./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.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 ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:52:32,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:52:32,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:52:32,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:52:32,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:52:32,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:52:32,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:52:32,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:52:32,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:52:32,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:52:32,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:52:32,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:52:32,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:52:32,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:52:32,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:52:32,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:52:32,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:52:32,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:52:32,824 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 -> ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 [2025-03-08 16:52:33,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:52:33,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:52:33,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:52:33,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:52:33,036 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:52:33,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2025-03-08 16:52:34,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf4b3e6f/ca9793bcb2f6430cb4625902eef45e02/FLAG1cfa8323d [2025-03-08 16:52:34,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:52:34,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2025-03-08 16:52:34,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf4b3e6f/ca9793bcb2f6430cb4625902eef45e02/FLAG1cfa8323d [2025-03-08 16:52:34,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf4b3e6f/ca9793bcb2f6430cb4625902eef45e02 [2025-03-08 16:52:34,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:52:34,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:52:34,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:52:34,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:52:34,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:52:34,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34, skipping insertion in model container [2025-03-08 16:52:34,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:52:34,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i[916,929] [2025-03-08 16:52:34,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:52:34,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:52:34,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i[916,929] [2025-03-08 16:52:34,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:52:34,704 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:52:34,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34 WrapperNode [2025-03-08 16:52:34,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:52:34,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:52:34,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:52:34,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:52:34,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,763 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-03-08 16:52:34,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:52:34,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:52:34,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:52:34,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:52:34,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,782 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:52:34,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:52:34,810 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:52:34,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:52:34,810 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:52:34,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (1/1) ... [2025-03-08 16:52:34,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:52:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:52:34,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:52:34,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:52:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:52:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:52:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:52:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:52:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:52:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:52:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:52:34,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:52:34,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:52:35,475 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~mem90#1;havoc property_#t~bitwise91#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1;havoc property_#t~ite157#1;havoc property_#t~mem145#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~bitwise144#1;havoc property_#t~ite154#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~short158#1; [2025-03-08 16:52:35,504 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-08 16:52:35,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:52:35,522 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:52:35,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:52:35,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:35 BoogieIcfgContainer [2025-03-08 16:52:35,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:52:35,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:52:35,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:52:35,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:52:35,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:52:34" (1/3) ... [2025-03-08 16:52:35,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee93d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:35, skipping insertion in model container [2025-03-08 16:52:35,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:34" (2/3) ... [2025-03-08 16:52:35,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee93d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:35, skipping insertion in model container [2025-03-08 16:52:35,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:35" (3/3) ... [2025-03-08 16:52:35,533 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-56.i [2025-03-08 16:52:35,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:52:35,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:52:35,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:52:35,627 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;@640a361c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:52:35,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:52:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:52:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:52:35,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:35,644 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:35,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -807210912, now seen corresponding path program 1 times [2025-03-08 16:52:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:35,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047434779] [2025-03-08 16:52:35,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:35,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:52:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:52:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:52:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047434779] [2025-03-08 16:52:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047434779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:52:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324226290] [2025-03-08 16:52:36,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:52:36,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:52:36,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:52:36,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:52:36,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:52:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:52:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:36,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:52:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:52:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:52:36,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:52:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324226290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:52:36,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:52:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804394732] [2025-03-08 16:52:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:36,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:52:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:52:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:52:36,273 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:52:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:36,304 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-03-08 16:52:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:52:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-08 16:52:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:36,311 INFO L225 Difference]: With dead ends: 244 [2025-03-08 16:52:36,311 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 16:52:36,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:52:36,316 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 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-08 16:52:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:52:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 16:52:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 16:52:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:52:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-08 16:52:36,369 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-03-08 16:52:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:36,370 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-08 16:52:36,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:52:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-08 16:52:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:52:36,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:36,373 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:36,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:52:36,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:52:36,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:36,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1867327191, now seen corresponding path program 1 times [2025-03-08 16:52:36,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764316535] [2025-03-08 16:52:36,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:36,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:52:36,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:52:36,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764316535] [2025-03-08 16:52:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764316535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:52:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512056352] [2025-03-08 16:52:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:38,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:52:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:38,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:52:38,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:52:38,453 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:40,103 INFO L93 Difference]: Finished difference Result 663 states and 992 transitions. [2025-03-08 16:52:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:52:40,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-08 16:52:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:40,108 INFO L225 Difference]: With dead ends: 663 [2025-03-08 16:52:40,108 INFO L226 Difference]: Without dead ends: 544 [2025-03-08 16:52:40,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:52:40,110 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 653 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:40,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1539 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:52:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-08 16:52:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 287. [2025-03-08 16:52:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 246 states have (on average 1.4552845528455285) internal successors, (358), 246 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 434 transitions. [2025-03-08 16:52:40,160 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 434 transitions. Word has length 151 [2025-03-08 16:52:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:40,161 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 434 transitions. [2025-03-08 16:52:40,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 434 transitions. [2025-03-08 16:52:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:52:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:40,165 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:52:40,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:40,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1923212252, now seen corresponding path program 1 times [2025-03-08 16:52:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453396621] [2025-03-08 16:52:40,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:40,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:52:40,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:52:40,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:40,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453396621] [2025-03-08 16:52:40,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453396621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:40,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:40,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:52:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75767162] [2025-03-08 16:52:40,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:40,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:52:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:40,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:52:40,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:52:40,267 INFO L87 Difference]: Start difference. First operand 287 states and 434 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:40,344 INFO L93 Difference]: Finished difference Result 572 states and 867 transitions. [2025-03-08 16:52:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:52:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:52:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:40,348 INFO L225 Difference]: With dead ends: 572 [2025-03-08 16:52:40,348 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 16:52:40,349 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-08 16:52:40,349 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:40,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:52:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 16:52:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-08 16:52:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 247 states have (on average 1.4493927125506072) internal successors, (358), 247 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 434 transitions. [2025-03-08 16:52:40,372 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 434 transitions. Word has length 152 [2025-03-08 16:52:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:40,373 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 434 transitions. [2025-03-08 16:52:40,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 434 transitions. [2025-03-08 16:52:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:52:40,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:40,377 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:40,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:52:40,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1756499512, now seen corresponding path program 1 times [2025-03-08 16:52:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:40,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490060599] [2025-03-08 16:52:40,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:40,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:52:40,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:52:40,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:40,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490060599] [2025-03-08 16:52:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490060599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:52:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168904728] [2025-03-08 16:52:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:40,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:52:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:40,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:52:40,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:52:40,488 INFO L87 Difference]: Start difference. First operand 288 states and 434 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:40,559 INFO L93 Difference]: Finished difference Result 577 states and 873 transitions. [2025-03-08 16:52:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:52:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:52:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:40,561 INFO L225 Difference]: With dead ends: 577 [2025-03-08 16:52:40,561 INFO L226 Difference]: Without dead ends: 292 [2025-03-08 16:52:40,562 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-08 16:52:40,562 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:40,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:52:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-08 16:52:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-08 16:52:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.4422310756972112) internal successors, (362), 251 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 438 transitions. [2025-03-08 16:52:40,576 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 438 transitions. Word has length 152 [2025-03-08 16:52:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:40,576 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 438 transitions. [2025-03-08 16:52:40,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 438 transitions. [2025-03-08 16:52:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:52:40,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:40,578 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:52:40,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1167816827, now seen corresponding path program 1 times [2025-03-08 16:52:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:40,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975134685] [2025-03-08 16:52:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:40,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:52:40,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:52:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:40,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:40,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975134685] [2025-03-08 16:52:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975134685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:52:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025266660] [2025-03-08 16:52:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:40,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:52:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:40,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:52:40,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:52:40,653 INFO L87 Difference]: Start difference. First operand 292 states and 438 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:40,720 INFO L93 Difference]: Finished difference Result 579 states and 869 transitions. [2025-03-08 16:52:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:52:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:52:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:40,723 INFO L225 Difference]: With dead ends: 579 [2025-03-08 16:52:40,723 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 16:52:40,723 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-08 16:52:40,724 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:40,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:52:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 16:52:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-08 16:52:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.429718875502008) internal successors, (356), 249 states have internal predecessors, (356), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 432 transitions. [2025-03-08 16:52:40,736 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 432 transitions. Word has length 152 [2025-03-08 16:52:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:40,736 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 432 transitions. [2025-03-08 16:52:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 432 transitions. [2025-03-08 16:52:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:40,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:40,738 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:52:40,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1343575892, now seen corresponding path program 1 times [2025-03-08 16:52:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273696881] [2025-03-08 16:52:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:40,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:40,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:40,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:40,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:52:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273696881] [2025-03-08 16:52:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273696881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:52:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832480195] [2025-03-08 16:52:40,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:52:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:52:40,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:52:40,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:52:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:41,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:41,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:41,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:52:41,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:52:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:41,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:52:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832480195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:41,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:52:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:52:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530207222] [2025-03-08 16:52:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:41,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:52:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:52:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:52:41,154 INFO L87 Difference]: Start difference. First operand 290 states and 432 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:41,185 INFO L93 Difference]: Finished difference Result 583 states and 869 transitions. [2025-03-08 16:52:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:52:41,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-08 16:52:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:41,187 INFO L225 Difference]: With dead ends: 583 [2025-03-08 16:52:41,187 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 16:52:41,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:52:41,188 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:41,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:52:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 16:52:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-08 16:52:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 255 states have (on average 1.419607843137255) internal successors, (362), 255 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 438 transitions. [2025-03-08 16:52:41,200 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 438 transitions. Word has length 153 [2025-03-08 16:52:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:41,200 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 438 transitions. [2025-03-08 16:52:41,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 438 transitions. [2025-03-08 16:52:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:41,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:41,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:41,209 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-08 16:52:41,402 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,SelfDestructingSolverStorable5 [2025-03-08 16:52:41,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:41,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1463848332, now seen corresponding path program 1 times [2025-03-08 16:52:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451601841] [2025-03-08 16:52:41,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:41,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:41,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:43,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451601841] [2025-03-08 16:52:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451601841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:43,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:52:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924940507] [2025-03-08 16:52:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:43,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:52:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:52:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:52:43,407 INFO L87 Difference]: Start difference. First operand 296 states and 438 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 16:52:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:44,348 INFO L93 Difference]: Finished difference Result 745 states and 1108 transitions. [2025-03-08 16:52:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:52:44,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-08 16:52:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:44,352 INFO L225 Difference]: With dead ends: 745 [2025-03-08 16:52:44,352 INFO L226 Difference]: Without dead ends: 452 [2025-03-08 16:52:44,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:52:44,353 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:44,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 918 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:52:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-08 16:52:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 361. [2025-03-08 16:52:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 320 states have (on average 1.459375) internal successors, (467), 320 states have internal predecessors, (467), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:52:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 543 transitions. [2025-03-08 16:52:44,378 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 543 transitions. Word has length 153 [2025-03-08 16:52:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 543 transitions. [2025-03-08 16:52:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 16:52:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 543 transitions. [2025-03-08 16:52:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:44,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:44,380 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:52:44,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 43703477, now seen corresponding path program 1 times [2025-03-08 16:52:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920805136] [2025-03-08 16:52:44,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:44,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:44,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920805136] [2025-03-08 16:52:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920805136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:52:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274534762] [2025-03-08 16:52:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:52:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:44,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:52:44,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:52:44,631 INFO L87 Difference]: Start difference. First operand 361 states and 543 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:44,969 INFO L93 Difference]: Finished difference Result 827 states and 1230 transitions. [2025-03-08 16:52:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:52:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-08 16:52:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:44,972 INFO L225 Difference]: With dead ends: 827 [2025-03-08 16:52:44,972 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 16:52:44,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:52:44,974 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 569 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:52:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 16:52:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2025-03-08 16:52:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 414 states have (on average 1.432367149758454) internal successors, (593), 416 states have internal predecessors, (593), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 685 transitions. [2025-03-08 16:52:45,003 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 685 transitions. Word has length 153 [2025-03-08 16:52:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:45,003 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 685 transitions. [2025-03-08 16:52:45,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 685 transitions. [2025-03-08 16:52:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:45,008 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:45,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:52:45,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:45,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -249699530, now seen corresponding path program 1 times [2025-03-08 16:52:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257512049] [2025-03-08 16:52:45,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:45,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:45,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:45,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:45,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257512049] [2025-03-08 16:52:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257512049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:52:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500636453] [2025-03-08 16:52:46,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:52:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:46,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:52:46,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:52:46,417 INFO L87 Difference]: Start difference. First operand 465 states and 685 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:47,995 INFO L93 Difference]: Finished difference Result 1316 states and 1921 transitions. [2025-03-08 16:52:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:52:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-08 16:52:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:48,000 INFO L225 Difference]: With dead ends: 1316 [2025-03-08 16:52:48,000 INFO L226 Difference]: Without dead ends: 854 [2025-03-08 16:52:48,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:52:48,002 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 809 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:48,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1119 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:52:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-08 16:52:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 469. [2025-03-08 16:52:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 418 states have (on average 1.4282296650717703) internal successors, (597), 420 states have internal predecessors, (597), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 689 transitions. [2025-03-08 16:52:48,030 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 689 transitions. Word has length 153 [2025-03-08 16:52:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 689 transitions. [2025-03-08 16:52:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 689 transitions. [2025-03-08 16:52:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:48,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:48,034 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:48,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:52:48,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:48,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2126667337, now seen corresponding path program 1 times [2025-03-08 16:52:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699882821] [2025-03-08 16:52:48,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:48,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:48,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699882821] [2025-03-08 16:52:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699882821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:52:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020228853] [2025-03-08 16:52:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:48,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:52:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:52:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:52:48,269 INFO L87 Difference]: Start difference. First operand 469 states and 689 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:48,572 INFO L93 Difference]: Finished difference Result 1103 states and 1621 transitions. [2025-03-08 16:52:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:52:48,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-08 16:52:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:48,577 INFO L225 Difference]: With dead ends: 1103 [2025-03-08 16:52:48,577 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 16:52:48,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:52:48,578 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 74 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:48,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 424 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:52:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 16:52:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 487. [2025-03-08 16:52:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 436 states have (on average 1.4288990825688073) internal successors, (623), 438 states have internal predecessors, (623), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 715 transitions. [2025-03-08 16:52:48,602 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 715 transitions. Word has length 153 [2025-03-08 16:52:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 715 transitions. [2025-03-08 16:52:48,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:52:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 715 transitions. [2025-03-08 16:52:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:48,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:48,604 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:52:48,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:48,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1504888038, now seen corresponding path program 1 times [2025-03-08 16:52:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120900749] [2025-03-08 16:52:48,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:48,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:48,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120900749] [2025-03-08 16:52:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120900749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:52:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442673107] [2025-03-08 16:52:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:50,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:52:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:50,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:52:50,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:52:50,075 INFO L87 Difference]: Start difference. First operand 487 states and 715 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:52:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:51,041 INFO L93 Difference]: Finished difference Result 1163 states and 1704 transitions. [2025-03-08 16:52:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:52:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-08 16:52:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:51,044 INFO L225 Difference]: With dead ends: 1163 [2025-03-08 16:52:51,044 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 16:52:51,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:52:51,046 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 68 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:51,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1101 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:52:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 16:52:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 531. [2025-03-08 16:52:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 480 states have (on average 1.4395833333333334) internal successors, (691), 482 states have internal predecessors, (691), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 783 transitions. [2025-03-08 16:52:51,068 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 783 transitions. Word has length 153 [2025-03-08 16:52:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 783 transitions. [2025-03-08 16:52:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:52:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 783 transitions. [2025-03-08 16:52:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:51,070 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:52:51,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1798291045, now seen corresponding path program 1 times [2025-03-08 16:52:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180901536] [2025-03-08 16:52:51,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:51,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:51,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:51,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180901536] [2025-03-08 16:52:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180901536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:52:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602823518] [2025-03-08 16:52:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:51,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:52:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:51,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:52:51,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:52:51,939 INFO L87 Difference]: Start difference. First operand 531 states and 783 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:52,543 INFO L93 Difference]: Finished difference Result 1205 states and 1760 transitions. [2025-03-08 16:52:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:52:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-08 16:52:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:52,554 INFO L225 Difference]: With dead ends: 1205 [2025-03-08 16:52:52,554 INFO L226 Difference]: Without dead ends: 677 [2025-03-08 16:52:52,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:52:52,559 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 82 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:52,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 682 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:52:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-08 16:52:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 533. [2025-03-08 16:52:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 482 states have (on average 1.4356846473029046) internal successors, (692), 484 states have internal predecessors, (692), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 784 transitions. [2025-03-08 16:52:52,582 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 784 transitions. Word has length 153 [2025-03-08 16:52:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:52,583 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 784 transitions. [2025-03-08 16:52:52,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 784 transitions. [2025-03-08 16:52:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:52,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:52,585 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:52:52,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1718584877, now seen corresponding path program 1 times [2025-03-08 16:52:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708629219] [2025-03-08 16:52:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:52,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708629219] [2025-03-08 16:52:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708629219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:55,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:52:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158653541] [2025-03-08 16:52:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:55,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:52:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:55,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:52:55,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:52:55,718 INFO L87 Difference]: Start difference. First operand 533 states and 784 transitions. Second operand has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:52:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:57,735 INFO L93 Difference]: Finished difference Result 1432 states and 2085 transitions. [2025-03-08 16:52:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:52:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-08 16:52:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:57,739 INFO L225 Difference]: With dead ends: 1432 [2025-03-08 16:52:57,739 INFO L226 Difference]: Without dead ends: 902 [2025-03-08 16:52:57,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:52:57,741 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 622 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:57,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1517 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 16:52:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-08 16:52:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 525. [2025-03-08 16:52:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 474 states have (on average 1.4345991561181435) internal successors, (680), 476 states have internal predecessors, (680), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2025-03-08 16:52:57,762 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 153 [2025-03-08 16:52:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:57,762 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2025-03-08 16:52:57,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:52:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2025-03-08 16:52:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:57,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:57,764 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:57,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:52:57,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:57,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -504436075, now seen corresponding path program 1 times [2025-03-08 16:52:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397034290] [2025-03-08 16:52:57,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:57,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:57,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:57,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397034290] [2025-03-08 16:52:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397034290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:58,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:52:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920275782] [2025-03-08 16:52:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:58,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:52:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:58,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:52:58,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:52:58,737 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:52:59,471 INFO L93 Difference]: Finished difference Result 1177 states and 1725 transitions. [2025-03-08 16:52:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:52:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-08 16:52:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:52:59,475 INFO L225 Difference]: With dead ends: 1177 [2025-03-08 16:52:59,475 INFO L226 Difference]: Without dead ends: 655 [2025-03-08 16:52:59,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:52:59,477 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 69 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:52:59,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1130 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:52:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-08 16:52:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 542. [2025-03-08 16:52:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 491 states have (on average 1.4378818737270875) internal successors, (706), 493 states have internal predecessors, (706), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:52:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 798 transitions. [2025-03-08 16:52:59,494 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 798 transitions. Word has length 153 [2025-03-08 16:52:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:52:59,494 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 798 transitions. [2025-03-08 16:52:59,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:52:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 798 transitions. [2025-03-08 16:52:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:52:59,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:52:59,496 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:52:59,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:52:59,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:52:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:52:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1759624583, now seen corresponding path program 1 times [2025-03-08 16:52:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:52:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668149054] [2025-03-08 16:52:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:52:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:52:59,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:52:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:52:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:52:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:52:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:52:59,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:52:59,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668149054] [2025-03-08 16:52:59,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668149054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:52:59,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:52:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:52:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073935876] [2025-03-08 16:52:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:52:59,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:52:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:52:59,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:52:59,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:52:59,965 INFO L87 Difference]: Start difference. First operand 542 states and 798 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:00,392 INFO L93 Difference]: Finished difference Result 1290 states and 1877 transitions. [2025-03-08 16:53:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:53:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-08 16:53:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:00,395 INFO L225 Difference]: With dead ends: 1290 [2025-03-08 16:53:00,395 INFO L226 Difference]: Without dead ends: 751 [2025-03-08 16:53:00,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:00,396 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 90 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:00,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 719 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:53:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-08 16:53:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 548. [2025-03-08 16:53:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 497 states have (on average 1.4366197183098592) internal successors, (714), 499 states have internal predecessors, (714), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 806 transitions. [2025-03-08 16:53:00,413 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 806 transitions. Word has length 153 [2025-03-08 16:53:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 806 transitions. [2025-03-08 16:53:00,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 806 transitions. [2025-03-08 16:53:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:53:00,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:00,414 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:00,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:53:00,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1728604776, now seen corresponding path program 1 times [2025-03-08 16:53:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923002872] [2025-03-08 16:53:00,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:00,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:53:00,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:53:00,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:00,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923002872] [2025-03-08 16:53:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923002872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:53:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462743791] [2025-03-08 16:53:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:01,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:53:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:01,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:53:01,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:53:01,797 INFO L87 Difference]: Start difference. First operand 548 states and 806 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:03,121 INFO L93 Difference]: Finished difference Result 1386 states and 2022 transitions. [2025-03-08 16:53:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:53:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-08 16:53:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:03,124 INFO L225 Difference]: With dead ends: 1386 [2025-03-08 16:53:03,125 INFO L226 Difference]: Without dead ends: 841 [2025-03-08 16:53:03,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:53:03,126 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 586 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:03,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1356 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:53:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-08 16:53:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 563. [2025-03-08 16:53:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 512 states have (on average 1.44140625) internal successors, (738), 514 states have internal predecessors, (738), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 830 transitions. [2025-03-08 16:53:03,143 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 830 transitions. Word has length 153 [2025-03-08 16:53:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:03,143 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 830 transitions. [2025-03-08 16:53:03,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 830 transitions. [2025-03-08 16:53:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:53:03,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:03,145 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:03,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:53:03,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2022007783, now seen corresponding path program 1 times [2025-03-08 16:53:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344527647] [2025-03-08 16:53:03,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:03,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:53:03,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:53:03,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:03,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:04,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:04,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344527647] [2025-03-08 16:53:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344527647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:04,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:53:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580401618] [2025-03-08 16:53:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:04,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:53:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:04,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:53:04,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:53:04,831 INFO L87 Difference]: Start difference. First operand 563 states and 830 transitions. Second operand has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:07,013 INFO L93 Difference]: Finished difference Result 1393 states and 2036 transitions. [2025-03-08 16:53:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:53:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-08 16:53:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:07,016 INFO L225 Difference]: With dead ends: 1393 [2025-03-08 16:53:07,016 INFO L226 Difference]: Without dead ends: 833 [2025-03-08 16:53:07,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:53:07,018 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 563 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2114 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 16:53:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-08 16:53:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 565. [2025-03-08 16:53:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 514 states have (on average 1.4396887159533074) internal successors, (740), 516 states have internal predecessors, (740), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 832 transitions. [2025-03-08 16:53:07,040 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 832 transitions. Word has length 153 [2025-03-08 16:53:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:07,041 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 832 transitions. [2025-03-08 16:53:07,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2025-03-08 16:53:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:53:07,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:07,044 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:53:07,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1713227448, now seen corresponding path program 1 times [2025-03-08 16:53:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783641215] [2025-03-08 16:53:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:53:07,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:53:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783641215] [2025-03-08 16:53:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783641215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:07,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:53:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633328580] [2025-03-08 16:53:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:53:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:07,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:53:07,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:53:07,253 INFO L87 Difference]: Start difference. First operand 565 states and 832 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:07,628 INFO L93 Difference]: Finished difference Result 1198 states and 1760 transitions. [2025-03-08 16:53:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:53:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-08 16:53:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:07,634 INFO L225 Difference]: With dead ends: 1198 [2025-03-08 16:53:07,634 INFO L226 Difference]: Without dead ends: 636 [2025-03-08 16:53:07,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:07,635 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 77 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:07,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 540 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-08 16:53:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 563. [2025-03-08 16:53:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 512 states have (on average 1.4375) internal successors, (736), 514 states have internal predecessors, (736), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 828 transitions. [2025-03-08 16:53:07,654 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 828 transitions. Word has length 153 [2025-03-08 16:53:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 828 transitions. [2025-03-08 16:53:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 828 transitions. [2025-03-08 16:53:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:53:07,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:07,657 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:53:07,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1373803291, now seen corresponding path program 1 times [2025-03-08 16:53:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041633844] [2025-03-08 16:53:07,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:53:07,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:53:07,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:07,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041633844] [2025-03-08 16:53:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041633844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:07,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:07,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:53:07,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771689110] [2025-03-08 16:53:07,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:07,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:53:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:53:07,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:53:07,710 INFO L87 Difference]: Start difference. First operand 563 states and 828 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:07,762 INFO L93 Difference]: Finished difference Result 1112 states and 1635 transitions. [2025-03-08 16:53:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:53:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-08 16:53:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:07,764 INFO L225 Difference]: With dead ends: 1112 [2025-03-08 16:53:07,764 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 16:53:07,765 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-08 16:53:07,765 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:07,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 16:53:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-08 16:53:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 501 states have (on average 1.4291417165668663) internal successors, (716), 503 states have internal predecessors, (716), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2025-03-08 16:53:07,779 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 154 [2025-03-08 16:53:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2025-03-08 16:53:07,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2025-03-08 16:53:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:07,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:07,781 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:07,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:53:07,781 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:07,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash 620818986, now seen corresponding path program 1 times [2025-03-08 16:53:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972897863] [2025-03-08 16:53:07,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:07,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:07,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972897863] [2025-03-08 16:53:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972897863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:53:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492748658] [2025-03-08 16:53:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:08,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:53:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:53:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:08,483 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:08,894 INFO L93 Difference]: Finished difference Result 1300 states and 1903 transitions. [2025-03-08 16:53:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:53:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:53:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:08,897 INFO L225 Difference]: With dead ends: 1300 [2025-03-08 16:53:08,897 INFO L226 Difference]: Without dead ends: 751 [2025-03-08 16:53:08,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:53:08,899 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:08,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 867 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:53:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-08 16:53:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 671. [2025-03-08 16:53:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 620 states have (on average 1.4419354838709677) internal successors, (894), 622 states have internal predecessors, (894), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:53:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 986 transitions. [2025-03-08 16:53:08,915 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 986 transitions. Word has length 155 [2025-03-08 16:53:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:08,915 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 986 transitions. [2025-03-08 16:53:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 986 transitions. [2025-03-08 16:53:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:08,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:08,916 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:08,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:53:08,917 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 651838793, now seen corresponding path program 1 times [2025-03-08 16:53:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082047424] [2025-03-08 16:53:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:08,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:08,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:08,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:08,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082047424] [2025-03-08 16:53:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082047424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:53:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746116158] [2025-03-08 16:53:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:53:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:10,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:53:10,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:53:10,260 INFO L87 Difference]: Start difference. First operand 671 states and 986 transitions. Second operand has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:13,440 INFO L93 Difference]: Finished difference Result 1575 states and 2282 transitions. [2025-03-08 16:53:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 16:53:13,441 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:13,443 INFO L225 Difference]: With dead ends: 1575 [2025-03-08 16:53:13,444 INFO L226 Difference]: Without dead ends: 907 [2025-03-08 16:53:13,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:53:13,445 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 707 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 3066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:13,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1875 Invalid, 3066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 16:53:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-08 16:53:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 727. [2025-03-08 16:53:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 668 states have (on average 1.4281437125748504) internal successors, (954), 671 states have internal predecessors, (954), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:53:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1058 transitions. [2025-03-08 16:53:13,467 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1058 transitions. Word has length 155 [2025-03-08 16:53:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:13,467 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1058 transitions. [2025-03-08 16:53:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1058 transitions. [2025-03-08 16:53:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:13,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:13,469 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:53:13,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash 537625079, now seen corresponding path program 1 times [2025-03-08 16:53:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727881290] [2025-03-08 16:53:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:13,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:13,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:13,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727881290] [2025-03-08 16:53:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727881290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 16:53:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101179664] [2025-03-08 16:53:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:53:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:53:16,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:53:16,133 INFO L87 Difference]: Start difference. First operand 727 states and 1058 transitions. Second operand has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:19,704 INFO L93 Difference]: Finished difference Result 1702 states and 2459 transitions. [2025-03-08 16:53:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 16:53:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-08 16:53:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:19,707 INFO L225 Difference]: With dead ends: 1702 [2025-03-08 16:53:19,707 INFO L226 Difference]: Without dead ends: 978 [2025-03-08 16:53:19,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=2113, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 16:53:19,709 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 469 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:19,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2948 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 16:53:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-08 16:53:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 817. [2025-03-08 16:53:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 755 states have (on average 1.4251655629139073) internal successors, (1076), 759 states have internal predecessors, (1076), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:53:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1184 transitions. [2025-03-08 16:53:19,733 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1184 transitions. Word has length 155 [2025-03-08 16:53:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:19,733 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1184 transitions. [2025-03-08 16:53:19,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1184 transitions. [2025-03-08 16:53:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:19,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:19,734 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:53:19,735 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash 244222072, now seen corresponding path program 1 times [2025-03-08 16:53:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681027990] [2025-03-08 16:53:19,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:19,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:19,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:19,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:19,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681027990] [2025-03-08 16:53:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681027990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:53:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687812920] [2025-03-08 16:53:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:19,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:53:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:19,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:53:19,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:53:19,896 INFO L87 Difference]: Start difference. First operand 817 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:20,134 INFO L93 Difference]: Finished difference Result 1752 states and 2525 transitions. [2025-03-08 16:53:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:53:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-08 16:53:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:20,137 INFO L225 Difference]: With dead ends: 1752 [2025-03-08 16:53:20,137 INFO L226 Difference]: Without dead ends: 938 [2025-03-08 16:53:20,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:20,139 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:20,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 470 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:53:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-08 16:53:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 813. [2025-03-08 16:53:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 751 states have (on average 1.4194407456724367) internal successors, (1066), 755 states have internal predecessors, (1066), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:53:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1174 transitions. [2025-03-08 16:53:20,162 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1174 transitions. Word has length 155 [2025-03-08 16:53:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1174 transitions. [2025-03-08 16:53:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1174 transitions. [2025-03-08 16:53:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:20,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:20,164 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:53:20,164 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:20,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash 282888534, now seen corresponding path program 1 times [2025-03-08 16:53:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770653217] [2025-03-08 16:53:20,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:20,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:20,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:20,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:20,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:20,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:20,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770653217] [2025-03-08 16:53:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770653217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:20,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:53:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206726306] [2025-03-08 16:53:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:53:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:20,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:53:20,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:53:20,318 INFO L87 Difference]: Start difference. First operand 813 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:20,571 INFO L93 Difference]: Finished difference Result 1690 states and 2426 transitions. [2025-03-08 16:53:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:53:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-08 16:53:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:20,575 INFO L225 Difference]: With dead ends: 1690 [2025-03-08 16:53:20,576 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 16:53:20,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:20,578 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:20,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 459 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:53:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 16:53:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 801. [2025-03-08 16:53:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 736 states have (on average 1.4116847826086956) internal successors, (1039), 740 states have internal predecessors, (1039), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:53:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1151 transitions. [2025-03-08 16:53:20,603 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1151 transitions. Word has length 155 [2025-03-08 16:53:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:20,603 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1151 transitions. [2025-03-08 16:53:20,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1151 transitions. [2025-03-08 16:53:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:20,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:20,604 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:53:20,604 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2016464617, now seen corresponding path program 1 times [2025-03-08 16:53:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363819757] [2025-03-08 16:53:20,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:20,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:20,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:20,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:20,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363819757] [2025-03-08 16:53:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363819757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:53:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929876583] [2025-03-08 16:53:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:53:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:21,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:53:21,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:53:21,551 INFO L87 Difference]: Start difference. First operand 801 states and 1151 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:22,536 INFO L93 Difference]: Finished difference Result 1662 states and 2375 transitions. [2025-03-08 16:53:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:53:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:22,540 INFO L225 Difference]: With dead ends: 1662 [2025-03-08 16:53:22,540 INFO L226 Difference]: Without dead ends: 864 [2025-03-08 16:53:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:53:22,542 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 88 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1200 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:53:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-08 16:53:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 839. [2025-03-08 16:53:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 765 states have (on average 1.3986928104575163) internal successors, (1070), 770 states have internal predecessors, (1070), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:53:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1194 transitions. [2025-03-08 16:53:22,580 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1194 transitions. Word has length 155 [2025-03-08 16:53:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1194 transitions. [2025-03-08 16:53:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1194 transitions. [2025-03-08 16:53:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:22,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:22,582 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:22,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:53:22,582 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 294204661, now seen corresponding path program 1 times [2025-03-08 16:53:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384835651] [2025-03-08 16:53:22,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:22,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:22,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:22,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:22,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384835651] [2025-03-08 16:53:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384835651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:24,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:53:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683258864] [2025-03-08 16:53:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:24,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:53:24,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:24,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:53:24,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:53:24,265 INFO L87 Difference]: Start difference. First operand 839 states and 1194 transitions. Second operand has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:26,319 INFO L93 Difference]: Finished difference Result 1813 states and 2569 transitions. [2025-03-08 16:53:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:53:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-08 16:53:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:26,323 INFO L225 Difference]: With dead ends: 1813 [2025-03-08 16:53:26,323 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 16:53:26,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:53:26,324 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 526 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:26,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1769 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 16:53:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 16:53:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 837. [2025-03-08 16:53:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 763 states have (on average 1.3971166448230667) internal successors, (1066), 768 states have internal predecessors, (1066), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:53:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1190 transitions. [2025-03-08 16:53:26,361 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1190 transitions. Word has length 155 [2025-03-08 16:53:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:26,361 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1190 transitions. [2025-03-08 16:53:26,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 16:53:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1190 transitions. [2025-03-08 16:53:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:26,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:26,363 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:26,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:53:26,364 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1508353463, now seen corresponding path program 1 times [2025-03-08 16:53:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605819169] [2025-03-08 16:53:26,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:26,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:26,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:26,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605819169] [2025-03-08 16:53:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605819169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:28,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:28,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:53:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585263184] [2025-03-08 16:53:28,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:53:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:28,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:53:28,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:53:28,035 INFO L87 Difference]: Start difference. First operand 837 states and 1190 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:29,815 INFO L93 Difference]: Finished difference Result 1816 states and 2567 transitions. [2025-03-08 16:53:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:53:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:29,818 INFO L225 Difference]: With dead ends: 1816 [2025-03-08 16:53:29,818 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 16:53:29,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:53:29,820 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 84 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:29,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2225 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:53:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 16:53:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 977. [2025-03-08 16:53:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 894 states have (on average 1.383668903803132) internal successors, (1237), 902 states have internal predecessors, (1237), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 60 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 16:53:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1373 transitions. [2025-03-08 16:53:29,857 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1373 transitions. Word has length 155 [2025-03-08 16:53:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:29,857 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1373 transitions. [2025-03-08 16:53:29,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1373 transitions. [2025-03-08 16:53:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:29,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:29,858 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:29,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:53:29,858 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:29,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 65702378, now seen corresponding path program 1 times [2025-03-08 16:53:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140625357] [2025-03-08 16:53:29,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:29,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:29,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:29,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:29,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:30,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140625357] [2025-03-08 16:53:30,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140625357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:30,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:30,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:53:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63252100] [2025-03-08 16:53:30,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:53:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:30,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:53:30,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:53:30,832 INFO L87 Difference]: Start difference. First operand 977 states and 1373 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:32,055 INFO L93 Difference]: Finished difference Result 2184 states and 3067 transitions. [2025-03-08 16:53:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:53:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:32,060 INFO L225 Difference]: With dead ends: 2184 [2025-03-08 16:53:32,060 INFO L226 Difference]: Without dead ends: 1210 [2025-03-08 16:53:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:53:32,061 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 88 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:32,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1910 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:53:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-08 16:53:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1057. [2025-03-08 16:53:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 974 states have (on average 1.393223819301848) internal successors, (1357), 982 states have internal predecessors, (1357), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 60 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 16:53:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1493 transitions. [2025-03-08 16:53:32,120 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1493 transitions. Word has length 155 [2025-03-08 16:53:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:32,120 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1493 transitions. [2025-03-08 16:53:32,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1493 transitions. [2025-03-08 16:53:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:32,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:32,121 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:32,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:53:32,122 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:32,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 194785097, now seen corresponding path program 1 times [2025-03-08 16:53:32,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:32,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128657288] [2025-03-08 16:53:32,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:32,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:32,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:32,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:32,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:32,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128657288] [2025-03-08 16:53:32,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128657288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:32,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:32,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:53:32,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659395418] [2025-03-08 16:53:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:32,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:53:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:32,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:53:32,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:32,798 INFO L87 Difference]: Start difference. First operand 1057 states and 1493 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:33,361 INFO L93 Difference]: Finished difference Result 2429 states and 3420 transitions. [2025-03-08 16:53:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:33,365 INFO L225 Difference]: With dead ends: 2429 [2025-03-08 16:53:33,366 INFO L226 Difference]: Without dead ends: 1375 [2025-03-08 16:53:33,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:33,367 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 79 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:33,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 858 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:53:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-08 16:53:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1177. [2025-03-08 16:53:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1086 states have (on average 1.3904235727440146) internal successors, (1510), 1095 states have internal predecessors, (1510), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1658 transitions. [2025-03-08 16:53:33,411 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1658 transitions. Word has length 155 [2025-03-08 16:53:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1658 transitions. [2025-03-08 16:53:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1658 transitions. [2025-03-08 16:53:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:33,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:33,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:53:33,412 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:33,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -439856247, now seen corresponding path program 1 times [2025-03-08 16:53:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811253636] [2025-03-08 16:53:33,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:33,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:33,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:33,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:33,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811253636] [2025-03-08 16:53:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811253636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:53:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68442139] [2025-03-08 16:53:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:34,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:34,135 INFO L87 Difference]: Start difference. First operand 1177 states and 1658 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:34,552 INFO L93 Difference]: Finished difference Result 2617 states and 3689 transitions. [2025-03-08 16:53:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:53:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:53:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:34,560 INFO L225 Difference]: With dead ends: 2617 [2025-03-08 16:53:34,560 INFO L226 Difference]: Without dead ends: 1443 [2025-03-08 16:53:34,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:34,561 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 64 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:34,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 705 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:53:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-08 16:53:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1226. [2025-03-08 16:53:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1135 states have (on average 1.3955947136563878) internal successors, (1584), 1144 states have internal predecessors, (1584), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1732 transitions. [2025-03-08 16:53:34,606 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1732 transitions. Word has length 155 [2025-03-08 16:53:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:34,606 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1732 transitions. [2025-03-08 16:53:34,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1732 transitions. [2025-03-08 16:53:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:34,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:34,607 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:34,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:53:34,607 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:34,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1027316395, now seen corresponding path program 1 times [2025-03-08 16:53:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:34,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458998193] [2025-03-08 16:53:34,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:34,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:34,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:34,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:35,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458998193] [2025-03-08 16:53:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458998193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:53:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176420889] [2025-03-08 16:53:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:53:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:35,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:53:35,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:35,281 INFO L87 Difference]: Start difference. First operand 1226 states and 1732 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:35,798 INFO L93 Difference]: Finished difference Result 2630 states and 3699 transitions. [2025-03-08 16:53:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:35,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:35,803 INFO L225 Difference]: With dead ends: 2630 [2025-03-08 16:53:35,803 INFO L226 Difference]: Without dead ends: 1407 [2025-03-08 16:53:35,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:35,804 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 81 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:35,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 784 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:53:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-08 16:53:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1225. [2025-03-08 16:53:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1134 states have (on average 1.3932980599647267) internal successors, (1580), 1143 states have internal predecessors, (1580), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1728 transitions. [2025-03-08 16:53:35,849 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1728 transitions. Word has length 155 [2025-03-08 16:53:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:35,849 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1728 transitions. [2025-03-08 16:53:35,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1728 transitions. [2025-03-08 16:53:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:35,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:35,850 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:35,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:53:35,851 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:35,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1156399114, now seen corresponding path program 1 times [2025-03-08 16:53:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997699030] [2025-03-08 16:53:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:35,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:35,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:35,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:36,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997699030] [2025-03-08 16:53:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997699030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:53:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052904371] [2025-03-08 16:53:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:53:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:36,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:53:36,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:53:36,822 INFO L87 Difference]: Start difference. First operand 1225 states and 1728 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:38,009 INFO L93 Difference]: Finished difference Result 2599 states and 3653 transitions. [2025-03-08 16:53:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:53:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-08 16:53:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:38,014 INFO L225 Difference]: With dead ends: 2599 [2025-03-08 16:53:38,014 INFO L226 Difference]: Without dead ends: 1377 [2025-03-08 16:53:38,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:53:38,016 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 77 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:38,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1912 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:53:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-08 16:53:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1231. [2025-03-08 16:53:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1140 states have (on average 1.3912280701754387) internal successors, (1586), 1149 states have internal predecessors, (1586), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1734 transitions. [2025-03-08 16:53:38,065 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1734 transitions. Word has length 155 [2025-03-08 16:53:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1734 transitions. [2025-03-08 16:53:38,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 16:53:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1734 transitions. [2025-03-08 16:53:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:38,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:38,066 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:53:38,066 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:38,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:38,066 INFO L85 PathProgramCache]: Analyzing trace with hash 758804075, now seen corresponding path program 1 times [2025-03-08 16:53:38,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:38,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580238162] [2025-03-08 16:53:38,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580238162] [2025-03-08 16:53:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580238162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:53:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392562969] [2025-03-08 16:53:38,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:38,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:38,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:38,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:38,954 INFO L87 Difference]: Start difference. First operand 1231 states and 1734 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:39,296 INFO L93 Difference]: Finished difference Result 2496 states and 3514 transitions. [2025-03-08 16:53:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:53:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:53:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:39,299 INFO L225 Difference]: With dead ends: 2496 [2025-03-08 16:53:39,299 INFO L226 Difference]: Without dead ends: 1268 [2025-03-08 16:53:39,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:39,301 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:39,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 722 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-08 16:53:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1231. [2025-03-08 16:53:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1140 states have (on average 1.3859649122807018) internal successors, (1580), 1149 states have internal predecessors, (1580), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1728 transitions. [2025-03-08 16:53:39,347 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1728 transitions. Word has length 155 [2025-03-08 16:53:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:39,347 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1728 transitions. [2025-03-08 16:53:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1728 transitions. [2025-03-08 16:53:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:39,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:39,348 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:39,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:53:39,349 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:39,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash 253245450, now seen corresponding path program 1 times [2025-03-08 16:53:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834127839] [2025-03-08 16:53:39,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:39,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:39,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834127839] [2025-03-08 16:53:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834127839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:53:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429323701] [2025-03-08 16:53:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:40,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:53:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:53:40,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:53:40,326 INFO L87 Difference]: Start difference. First operand 1231 states and 1728 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:41,341 INFO L93 Difference]: Finished difference Result 2569 states and 3602 transitions. [2025-03-08 16:53:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:53:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:53:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:41,345 INFO L225 Difference]: With dead ends: 2569 [2025-03-08 16:53:41,345 INFO L226 Difference]: Without dead ends: 1341 [2025-03-08 16:53:41,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:53:41,346 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:41,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1756 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:53:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-03-08 16:53:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1235. [2025-03-08 16:53:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1144 states have (on average 1.3846153846153846) internal successors, (1584), 1153 states have internal predecessors, (1584), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1732 transitions. [2025-03-08 16:53:41,391 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1732 transitions. Word has length 155 [2025-03-08 16:53:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:41,391 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1732 transitions. [2025-03-08 16:53:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1732 transitions. [2025-03-08 16:53:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:53:41,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:41,393 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:53:41,393 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1343942186, now seen corresponding path program 1 times [2025-03-08 16:53:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289665770] [2025-03-08 16:53:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:41,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:53:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:53:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289665770] [2025-03-08 16:53:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289665770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:42,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:42,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:53:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073740253] [2025-03-08 16:53:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:42,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:53:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:42,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:53:42,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:53:42,359 INFO L87 Difference]: Start difference. First operand 1235 states and 1732 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:43,245 INFO L93 Difference]: Finished difference Result 2568 states and 3598 transitions. [2025-03-08 16:53:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:53:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-08 16:53:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:43,249 INFO L225 Difference]: With dead ends: 2568 [2025-03-08 16:53:43,249 INFO L226 Difference]: Without dead ends: 1336 [2025-03-08 16:53:43,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:53:43,250 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 64 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:43,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1638 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:53:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-03-08 16:53:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1224. [2025-03-08 16:53:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1133 states have (on average 1.3857016769638129) internal successors, (1570), 1142 states have internal predecessors, (1570), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1718 transitions. [2025-03-08 16:53:43,295 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1718 transitions. Word has length 155 [2025-03-08 16:53:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1718 transitions. [2025-03-08 16:53:43,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1718 transitions. [2025-03-08 16:53:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:53:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:43,296 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:53:43,296 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1648526710, now seen corresponding path program 1 times [2025-03-08 16:53:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208806512] [2025-03-08 16:53:43,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:43,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:53:43,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:53:43,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:43,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:53:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208806512] [2025-03-08 16:53:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208806512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459748258] [2025-03-08 16:53:43,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:43,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:43,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:43,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:43,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:53:43,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:53:43,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:53:43,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:43,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:43,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:53:43,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:43,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459748258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:53:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062793936] [2025-03-08 16:53:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:43,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:43,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:53:43,698 INFO L87 Difference]: Start difference. First operand 1224 states and 1718 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:43,760 INFO L93 Difference]: Finished difference Result 2489 states and 3488 transitions. [2025-03-08 16:53:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:53:43,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-03-08 16:53:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:43,763 INFO L225 Difference]: With dead ends: 2489 [2025-03-08 16:53:43,763 INFO L226 Difference]: Without dead ends: 1268 [2025-03-08 16:53:43,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:53:43,765 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:43,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-08 16:53:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1235. [2025-03-08 16:53:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1144 states have (on average 1.381993006993007) internal successors, (1581), 1153 states have internal predecessors, (1581), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1729 transitions. [2025-03-08 16:53:43,810 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1729 transitions. Word has length 156 [2025-03-08 16:53:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1729 transitions. [2025-03-08 16:53:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1729 transitions. [2025-03-08 16:53:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:53:43,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:43,811 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:43,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:53:44,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:44,012 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:44,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1284390408, now seen corresponding path program 1 times [2025-03-08 16:53:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188251522] [2025-03-08 16:53:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:53:44,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:53:44,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:44,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188251522] [2025-03-08 16:53:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188251522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:53:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845329637] [2025-03-08 16:53:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:53:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:44,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:53:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:53:44,127 INFO L87 Difference]: Start difference. First operand 1235 states and 1729 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:44,503 INFO L93 Difference]: Finished difference Result 3454 states and 4777 transitions. [2025-03-08 16:53:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:53:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-08 16:53:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:44,507 INFO L225 Difference]: With dead ends: 3454 [2025-03-08 16:53:44,507 INFO L226 Difference]: Without dead ends: 2222 [2025-03-08 16:53:44,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:44,509 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 137 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:44,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 342 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-08 16:53:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1471. [2025-03-08 16:53:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1380 states have (on average 1.3268115942028986) internal successors, (1831), 1389 states have internal predecessors, (1831), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:53:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1979 transitions. [2025-03-08 16:53:44,563 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1979 transitions. Word has length 158 [2025-03-08 16:53:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:44,563 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1979 transitions. [2025-03-08 16:53:44,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1979 transitions. [2025-03-08 16:53:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:53:44,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:44,564 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:44,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:53:44,564 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1049630179, now seen corresponding path program 1 times [2025-03-08 16:53:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551254135] [2025-03-08 16:53:44,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:44,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:53:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:53:44,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:44,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551254135] [2025-03-08 16:53:44,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551254135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:44,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:44,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:53:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529034829] [2025-03-08 16:53:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:44,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:53:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:44,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:53:44,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:53:44,929 INFO L87 Difference]: Start difference. First operand 1471 states and 1979 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:45,493 INFO L93 Difference]: Finished difference Result 3192 states and 4183 transitions. [2025-03-08 16:53:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:53:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-08 16:53:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:45,499 INFO L225 Difference]: With dead ends: 3192 [2025-03-08 16:53:45,499 INFO L226 Difference]: Without dead ends: 3190 [2025-03-08 16:53:45,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:53:45,500 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 254 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:45,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 843 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:53:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2025-03-08 16:53:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 2685. [2025-03-08 16:53:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2512 states have (on average 1.2914012738853504) internal successors, (3244), 2532 states have internal predecessors, (3244), 140 states have call successors, (140), 32 states have call predecessors, (140), 32 states have return successors, (140), 120 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 16:53:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3524 transitions. [2025-03-08 16:53:45,600 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3524 transitions. Word has length 158 [2025-03-08 16:53:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3524 transitions. [2025-03-08 16:53:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3524 transitions. [2025-03-08 16:53:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:53:45,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:45,602 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:53:45,602 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:45,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2007592321, now seen corresponding path program 1 times [2025-03-08 16:53:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998440064] [2025-03-08 16:53:45,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:45,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:45,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:45,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:45,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998440064] [2025-03-08 16:53:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998440064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:46,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:53:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478163104] [2025-03-08 16:53:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:46,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:46,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:46,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:46,106 INFO L87 Difference]: Start difference. First operand 2685 states and 3524 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:46,632 INFO L93 Difference]: Finished difference Result 7815 states and 10256 transitions. [2025-03-08 16:53:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-08 16:53:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:46,646 INFO L225 Difference]: With dead ends: 7815 [2025-03-08 16:53:46,646 INFO L226 Difference]: Without dead ends: 5133 [2025-03-08 16:53:46,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:46,654 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 84 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:46,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 759 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-03-08 16:53:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5127. [2025-03-08 16:53:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4810 states have (on average 1.2852390852390851) internal successors, (6182), 4852 states have internal predecessors, (6182), 252 states have call successors, (252), 64 states have call predecessors, (252), 64 states have return successors, (252), 210 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 16:53:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 6686 transitions. [2025-03-08 16:53:46,869 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 6686 transitions. Word has length 160 [2025-03-08 16:53:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:46,869 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 6686 transitions. [2025-03-08 16:53:46,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 6686 transitions. [2025-03-08 16:53:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:53:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:46,872 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:53:46,872 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -640600118, now seen corresponding path program 1 times [2025-03-08 16:53:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214128664] [2025-03-08 16:53:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:46,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:46,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:46,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:46,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214128664] [2025-03-08 16:53:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214128664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:53:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143707773] [2025-03-08 16:53:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:47,492 INFO L87 Difference]: Start difference. First operand 5127 states and 6686 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:48,030 INFO L93 Difference]: Finished difference Result 8007 states and 10487 transitions. [2025-03-08 16:53:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:53:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-08 16:53:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:48,039 INFO L225 Difference]: With dead ends: 8007 [2025-03-08 16:53:48,039 INFO L226 Difference]: Without dead ends: 5129 [2025-03-08 16:53:48,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:48,042 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:48,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 562 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2025-03-08 16:53:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 5127. [2025-03-08 16:53:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4810 states have (on average 1.2827442827442828) internal successors, (6170), 4852 states have internal predecessors, (6170), 252 states have call successors, (252), 64 states have call predecessors, (252), 64 states have return successors, (252), 210 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 16:53:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 6674 transitions. [2025-03-08 16:53:48,244 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 6674 transitions. Word has length 160 [2025-03-08 16:53:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:48,245 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 6674 transitions. [2025-03-08 16:53:48,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 6674 transitions. [2025-03-08 16:53:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:53:48,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:48,248 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:48,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:53:48,248 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -511517399, now seen corresponding path program 1 times [2025-03-08 16:53:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597582052] [2025-03-08 16:53:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:48,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:48,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:48,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 16:53:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597582052] [2025-03-08 16:53:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597582052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389644103] [2025-03-08 16:53:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:48,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:48,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:53:48,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:48,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:48,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:48,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:53:48,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:48,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389644103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-08 16:53:48,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893497390] [2025-03-08 16:53:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:48,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:53:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:48,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:53:48,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:53:48,734 INFO L87 Difference]: Start difference. First operand 5127 states and 6674 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:48,937 INFO L93 Difference]: Finished difference Result 10419 states and 13549 transitions. [2025-03-08 16:53:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-03-08 16:53:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:48,948 INFO L225 Difference]: With dead ends: 10419 [2025-03-08 16:53:48,948 INFO L226 Difference]: Without dead ends: 5295 [2025-03-08 16:53:48,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:53:48,954 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:48,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-03-08 16:53:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5119. [2025-03-08 16:53:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5119 states, 4802 states have (on average 1.2815493544356518) internal successors, (6154), 4844 states have internal predecessors, (6154), 252 states have call successors, (252), 64 states have call predecessors, (252), 64 states have return successors, (252), 210 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 16:53:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6658 transitions. [2025-03-08 16:53:49,193 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6658 transitions. Word has length 160 [2025-03-08 16:53:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 5119 states and 6658 transitions. [2025-03-08 16:53:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6658 transitions. [2025-03-08 16:53:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:53:49,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:49,196 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:49,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:53:49,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:49,401 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1314490624, now seen corresponding path program 1 times [2025-03-08 16:53:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451643761] [2025-03-08 16:53:49,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:49,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:49,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451643761] [2025-03-08 16:53:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451643761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:53:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504563295] [2025-03-08 16:53:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:53:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:49,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:53:49,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:53:49,816 INFO L87 Difference]: Start difference. First operand 5119 states and 6658 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:50,362 INFO L93 Difference]: Finished difference Result 11414 states and 14785 transitions. [2025-03-08 16:53:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:50,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-08 16:53:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:50,373 INFO L225 Difference]: With dead ends: 11414 [2025-03-08 16:53:50,373 INFO L226 Difference]: Without dead ends: 6298 [2025-03-08 16:53:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:50,378 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 154 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:50,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 687 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:53:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2025-03-08 16:53:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 6270. [2025-03-08 16:53:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6270 states, 5871 states have (on average 1.2687787429739397) internal successors, (7449), 5924 states have internal predecessors, (7449), 316 states have call successors, (316), 82 states have call predecessors, (316), 82 states have return successors, (316), 263 states have call predecessors, (316), 316 states have call successors, (316) [2025-03-08 16:53:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8081 transitions. [2025-03-08 16:53:50,639 INFO L78 Accepts]: Start accepts. Automaton has 6270 states and 8081 transitions. Word has length 160 [2025-03-08 16:53:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:50,639 INFO L471 AbstractCegarLoop]: Abstraction has 6270 states and 8081 transitions. [2025-03-08 16:53:50,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:53:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6270 states and 8081 transitions. [2025-03-08 16:53:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:53:50,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:50,643 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:50,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:53:50,643 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:50,644 INFO L85 PathProgramCache]: Analyzing trace with hash -289800181, now seen corresponding path program 1 times [2025-03-08 16:53:50,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573494876] [2025-03-08 16:53:50,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:50,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:53:50,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:53:50,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:53:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573494876] [2025-03-08 16:53:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573494876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:53:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165871445] [2025-03-08 16:53:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:53:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:53:50,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:50,767 INFO L87 Difference]: Start difference. First operand 6270 states and 8081 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:53:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:51,016 INFO L93 Difference]: Finished difference Result 12537 states and 16159 transitions. [2025-03-08 16:53:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:53:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-03-08 16:53:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:51,025 INFO L225 Difference]: With dead ends: 12537 [2025-03-08 16:53:51,026 INFO L226 Difference]: Without dead ends: 6270 [2025-03-08 16:53:51,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:51,032 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:51,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6270 states.