./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.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 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:07:46,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:07:46,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:07:46,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:07:46,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:07:46,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:07:46,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:07:46,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:07:46,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:07:46,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:07:46,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:07:46,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:07:46,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:07:46,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:07:46,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:07:46,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:07:46,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:07:46,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:07:46,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:07:46,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:07:46,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:07:46,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:07:46,735 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 -> 4c8d69d1f3064c47045f447426cd788cf9b3338c09ab601cc7dd6947b7697cf1 [2025-03-08 17:07:46,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:07:46,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:07:46,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:07:46,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:07:46,958 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:07:46,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2025-03-08 17:07:48,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cdfbe7/90c862665cb740fe93c7d926d3876be1/FLAG83993905f [2025-03-08 17:07:48,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:07:48,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2025-03-08 17:07:48,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cdfbe7/90c862665cb740fe93c7d926d3876be1/FLAG83993905f [2025-03-08 17:07:48,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3cdfbe7/90c862665cb740fe93c7d926d3876be1 [2025-03-08 17:07:48,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:07:48,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:07:48,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:07:48,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:07:48,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:07:48,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d369b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48, skipping insertion in model container [2025-03-08 17:07:48,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:07:48,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2025-03-08 17:07:48,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:07:48,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:07:48,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2025-03-08 17:07:48,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:07:48,865 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:07:48,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48 WrapperNode [2025-03-08 17:07:48,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:07:48,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:07:48,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:07:48,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:07:48,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,919 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2025-03-08 17:07:48,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:07:48,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:07:48,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:07:48,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:07:48,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,935 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:07:48,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:07:48,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:07:48,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:07:48,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:07:48,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (1/1) ... [2025-03-08 17:07:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:07:48,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:48,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:07:48,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:07:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:07:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:07:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:07:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:07:49,106 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:07:49,107 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:07:49,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-08 17:07:49,576 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-08 17:07:49,576 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:07:49,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:07:49,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:07:49,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:07:49 BoogieIcfgContainer [2025-03-08 17:07:49,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:07:49,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:07:49,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:07:49,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:07:49,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:07:48" (1/3) ... [2025-03-08 17:07:49,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56735c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:07:49, skipping insertion in model container [2025-03-08 17:07:49,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:07:48" (2/3) ... [2025-03-08 17:07:49,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56735c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:07:49, skipping insertion in model container [2025-03-08 17:07:49,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:07:49" (3/3) ... [2025-03-08 17:07:49,606 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2025-03-08 17:07:49,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:07:49,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-88.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:07:49,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:07:49,666 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;@7d8a6ccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:07:49,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:07:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:07:49,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:49,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:49,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1534683364, now seen corresponding path program 1 times [2025-03-08 17:07:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120744136] [2025-03-08 17:07:49,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:49,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:49,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:49,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:49,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 17:07:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120744136] [2025-03-08 17:07:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120744136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:07:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720853494] [2025-03-08 17:07:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:50,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:07:50,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:07:50,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:50,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:07:50,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:07:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 17:07:50,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:07:50,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720853494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:50,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:07:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:07:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016282829] [2025-03-08 17:07:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:50,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:07:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:50,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:07:50,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:07:50,289 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:07:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:50,344 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-03-08 17:07:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:07:50,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-08 17:07:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:50,351 INFO L225 Difference]: With dead ends: 230 [2025-03-08 17:07:50,351 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 17:07:50,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:07:50,355 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:50,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 17:07:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 17:07:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-08 17:07:50,386 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-03-08 17:07:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-08 17:07:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:07:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-08 17:07:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:07:50,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:50,391 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:50,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:07:50,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:07:50,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash -186126055, now seen corresponding path program 1 times [2025-03-08 17:07:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662482397] [2025-03-08 17:07:50,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:50,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:50,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:50,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:50,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662482397] [2025-03-08 17:07:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662482397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789677758] [2025-03-08 17:07:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:50,918 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:50,977 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-08 17:07:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 17:07:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:50,982 INFO L225 Difference]: With dead ends: 230 [2025-03-08 17:07:50,982 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 17:07:50,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:50,983 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:50,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 17:07:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-08 17:07:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-08 17:07:50,991 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-03-08 17:07:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:50,993 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-08 17:07:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-08 17:07:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:07:50,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:50,995 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:07:50,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:50,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1993580518, now seen corresponding path program 1 times [2025-03-08 17:07:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968954366] [2025-03-08 17:07:50,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:51,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968954366] [2025-03-08 17:07:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968954366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773681740] [2025-03-08 17:07:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:51,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:51,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:51,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:51,177 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:51,219 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-03-08 17:07:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 17:07:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:51,222 INFO L225 Difference]: With dead ends: 234 [2025-03-08 17:07:51,224 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 17:07:51,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:51,225 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:51,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 17:07:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-08 17:07:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-08 17:07:51,235 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-03-08 17:07:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-08 17:07:51,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-08 17:07:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:07:51,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:51,240 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:51,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:07:51,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1106076837, now seen corresponding path program 1 times [2025-03-08 17:07:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552874554] [2025-03-08 17:07:51,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:51,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:51,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:51,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552874554] [2025-03-08 17:07:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552874554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:07:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533562330] [2025-03-08 17:07:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:07:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:51,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:07:51,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:51,428 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:51,467 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-03-08 17:07:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:07:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 17:07:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:51,469 INFO L225 Difference]: With dead ends: 238 [2025-03-08 17:07:51,470 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 17:07:51,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:07:51,471 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:51,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 17:07:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-08 17:07:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-03-08 17:07:51,484 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-03-08 17:07:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-03-08 17:07:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-03-08 17:07:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:07:51,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:51,488 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:07:51,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1105153316, now seen corresponding path program 1 times [2025-03-08 17:07:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543800372] [2025-03-08 17:07:51,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:07:51,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:07:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543800372] [2025-03-08 17:07:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543800372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:07:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224628846] [2025-03-08 17:07:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:07:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:53,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:07:53,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:53,326 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:53,938 INFO L93 Difference]: Finished difference Result 303 states and 436 transitions. [2025-03-08 17:07:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:07:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 17:07:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:53,940 INFO L225 Difference]: With dead ends: 303 [2025-03-08 17:07:53,940 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 17:07:53,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:07:53,941 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 274 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:53,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 548 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:07:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 17:07:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2025-03-08 17:07:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-03-08 17:07:53,956 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 143 [2025-03-08 17:07:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:53,960 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-03-08 17:07:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-03-08 17:07:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 17:07:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:53,961 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:07:53,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 845832442, now seen corresponding path program 1 times [2025-03-08 17:07:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798910386] [2025-03-08 17:07:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 17:07:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 17:07:54,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798910386] [2025-03-08 17:07:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798910386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:07:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518227896] [2025-03-08 17:07:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:07:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:55,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:07:55,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:55,625 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:56,183 INFO L93 Difference]: Finished difference Result 335 states and 484 transitions. [2025-03-08 17:07:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:07:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 17:07:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:56,187 INFO L225 Difference]: With dead ends: 335 [2025-03-08 17:07:56,187 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 17:07:56,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:07:56,188 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 310 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:56,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 469 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:07:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 17:07:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2025-03-08 17:07:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2025-03-08 17:07:56,211 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 145 [2025-03-08 17:07:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2025-03-08 17:07:56,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2025-03-08 17:07:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 17:07:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:56,214 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:56,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:07:56,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1241611270, now seen corresponding path program 1 times [2025-03-08 17:07:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935640747] [2025-03-08 17:07:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:56,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 17:07:56,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 17:07:56,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:57,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935640747] [2025-03-08 17:07:57,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935640747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:57,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:07:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:07:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134414552] [2025-03-08 17:07:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:57,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:07:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:57,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:07:57,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:07:57,608 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:07:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:58,383 INFO L93 Difference]: Finished difference Result 351 states and 508 transitions. [2025-03-08 17:07:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:07:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-08 17:07:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:58,385 INFO L225 Difference]: With dead ends: 351 [2025-03-08 17:07:58,385 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 17:07:58,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:07:58,386 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 367 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:58,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 446 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:07:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 17:07:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 141. [2025-03-08 17:07:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-08 17:07:58,398 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2025-03-08 17:07:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-08 17:07:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:07:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-08 17:07:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 17:07:58,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:58,400 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:07:58,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607274, now seen corresponding path program 1 times [2025-03-08 17:07:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844645565] [2025-03-08 17:07:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:58,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 17:07:58,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 17:07:58,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:07:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:07:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844645565] [2025-03-08 17:07:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844645565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:07:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371351510] [2025-03-08 17:07:58,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:07:58,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:07:58,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:07:58,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:07:58,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 17:07:58,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 17:07:58,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:07:58,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:07:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:07:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:07:58,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:07:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371351510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:07:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:07:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 17:07:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461427729] [2025-03-08 17:07:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:07:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:07:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:07:58,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:07:58,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:58,818 INFO L87 Difference]: Start difference. First operand 141 states and 204 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:07:58,858 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-03-08 17:07:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:07:58,860 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 17:07:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:07:58,861 INFO L225 Difference]: With dead ends: 282 [2025-03-08 17:07:58,861 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 17:07:58,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:07:58,862 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:07:58,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:07:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 17:07:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-08 17:07:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.384) internal successors, (173), 125 states have internal predecessors, (173), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:07:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2025-03-08 17:07:58,875 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 145 [2025-03-08 17:07:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:07:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2025-03-08 17:07:58,876 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:07:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2025-03-08 17:07:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:07:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:07:58,877 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:07:58,885 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 17:07:59,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 17:07:59,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:07:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:07:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2109488439, now seen corresponding path program 1 times [2025-03-08 17:07:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:07:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101142410] [2025-03-08 17:07:59,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:07:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:07:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:07:59,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:07:59,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:07:59,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101142410] [2025-03-08 17:08:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101142410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:08:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237402220] [2025-03-08 17:08:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:08:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:00,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:08:00,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:00,114 INFO L87 Difference]: Start difference. First operand 144 states and 207 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:08:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:00,717 INFO L93 Difference]: Finished difference Result 348 states and 498 transitions. [2025-03-08 17:08:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-08 17:08:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:00,719 INFO L225 Difference]: With dead ends: 348 [2025-03-08 17:08:00,719 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 17:08:00,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:08:00,720 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 330 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:00,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 503 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:08:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 17:08:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2025-03-08 17:08:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:08:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2025-03-08 17:08:00,735 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 146 [2025-03-08 17:08:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2025-03-08 17:08:00,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:08:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2025-03-08 17:08:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:08:00,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:00,737 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:00,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:08:00,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:00,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1049961112, now seen corresponding path program 1 times [2025-03-08 17:08:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:00,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584156914] [2025-03-08 17:08:00,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:00,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:08:00,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:08:00,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:00,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584156914] [2025-03-08 17:08:02,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584156914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:02,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:02,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:08:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706499127] [2025-03-08 17:08:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:02,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:08:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:02,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:08:02,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:02,231 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:08:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:02,846 INFO L93 Difference]: Finished difference Result 325 states and 472 transitions. [2025-03-08 17:08:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:08:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-03-08 17:08:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:02,849 INFO L225 Difference]: With dead ends: 325 [2025-03-08 17:08:02,849 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 17:08:02,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:02,850 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 316 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:02,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 313 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:08:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 17:08:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2025-03-08 17:08:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:08:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2025-03-08 17:08:02,863 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 147 [2025-03-08 17:08:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:02,863 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2025-03-08 17:08:02,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:08:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2025-03-08 17:08:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 17:08:02,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:02,864 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:02,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:08:02,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:02,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1100012089, now seen corresponding path program 1 times [2025-03-08 17:08:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003853142] [2025-03-08 17:08:02,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:02,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 17:08:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 17:08:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003853142] [2025-03-08 17:08:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003853142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:08:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885490746] [2025-03-08 17:08:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:08:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:03,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:08:03,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:08:03,513 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:03,769 INFO L93 Difference]: Finished difference Result 430 states and 622 transitions. [2025-03-08 17:08:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:08:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-08 17:08:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:03,772 INFO L225 Difference]: With dead ends: 430 [2025-03-08 17:08:03,772 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 17:08:03,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:08:03,773 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 140 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:03,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 375 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:08:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 17:08:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 227. [2025-03-08 17:08:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.368421052631579) internal successors, (260), 190 states have internal predecessors, (260), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-03-08 17:08:03,800 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 147 [2025-03-08 17:08:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:03,800 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-03-08 17:08:03,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-03-08 17:08:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 17:08:03,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:03,802 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:03,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:08:03,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:03,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash -633053946, now seen corresponding path program 1 times [2025-03-08 17:08:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:03,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406714647] [2025-03-08 17:08:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:03,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 17:08:03,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 17:08:03,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:03,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406714647] [2025-03-08 17:08:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406714647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:04,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:04,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:08:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499142448] [2025-03-08 17:08:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:04,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:08:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:04,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:08:04,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:08:04,098 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:04,298 INFO L93 Difference]: Finished difference Result 463 states and 669 transitions. [2025-03-08 17:08:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:08:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 17:08:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:04,301 INFO L225 Difference]: With dead ends: 463 [2025-03-08 17:08:04,302 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 17:08:04,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:08:04,303 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:04,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 378 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:08:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 17:08:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 229. [2025-03-08 17:08:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.359375) internal successors, (261), 192 states have internal predecessors, (261), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2025-03-08 17:08:04,330 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 149 [2025-03-08 17:08:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:04,330 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2025-03-08 17:08:04,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2025-03-08 17:08:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 17:08:04,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:04,331 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:04,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:08:04,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -240134859, now seen corresponding path program 1 times [2025-03-08 17:08:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171845238] [2025-03-08 17:08:04,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:04,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:04,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 17:08:04,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 17:08:04,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:04,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171845238] [2025-03-08 17:08:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171845238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:08:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851174354] [2025-03-08 17:08:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:08:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:04,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:08:04,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:08:04,628 INFO L87 Difference]: Start difference. First operand 229 states and 329 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:04,767 INFO L93 Difference]: Finished difference Result 412 states and 589 transitions. [2025-03-08 17:08:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:08:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 17:08:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:04,769 INFO L225 Difference]: With dead ends: 412 [2025-03-08 17:08:04,770 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 17:08:04,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:08:04,771 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 86 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:04,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 421 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:08:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 17:08:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2025-03-08 17:08:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2025-03-08 17:08:04,801 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 151 [2025-03-08 17:08:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2025-03-08 17:08:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2025-03-08 17:08:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 17:08:04,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:04,803 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:04,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:08:04,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:04,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2016776148, now seen corresponding path program 1 times [2025-03-08 17:08:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257468368] [2025-03-08 17:08:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 17:08:04,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 17:08:04,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:04,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257468368] [2025-03-08 17:08:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257468368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:08:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114745013] [2025-03-08 17:08:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:08:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:08:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:08:05,170 INFO L87 Difference]: Start difference. First operand 234 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:05,466 INFO L93 Difference]: Finished difference Result 443 states and 633 transitions. [2025-03-08 17:08:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:08:05,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 17:08:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:05,468 INFO L225 Difference]: With dead ends: 443 [2025-03-08 17:08:05,468 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 17:08:05,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:08:05,469 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:05,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 637 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:08:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 17:08:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 240. [2025-03-08 17:08:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 342 transitions. [2025-03-08 17:08:05,499 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 342 transitions. Word has length 151 [2025-03-08 17:08:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:05,499 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 342 transitions. [2025-03-08 17:08:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 342 transitions. [2025-03-08 17:08:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 17:08:05,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:05,501 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:05,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:08:05,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:05,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1883712145, now seen corresponding path program 1 times [2025-03-08 17:08:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912560722] [2025-03-08 17:08:05,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:05,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 17:08:05,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 17:08:05,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:05,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:06,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912560722] [2025-03-08 17:08:06,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912560722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:06,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:08:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861971765] [2025-03-08 17:08:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:06,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:08:06,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:06,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:08:06,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:08:06,612 INFO L87 Difference]: Start difference. First operand 240 states and 342 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:07,136 INFO L93 Difference]: Finished difference Result 467 states and 664 transitions. [2025-03-08 17:08:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2025-03-08 17:08:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:07,138 INFO L225 Difference]: With dead ends: 467 [2025-03-08 17:08:07,138 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 17:08:07,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:07,139 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 311 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:07,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 573 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 17:08:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 236. [2025-03-08 17:08:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 199 states have (on average 1.3467336683417086) internal successors, (268), 199 states have internal predecessors, (268), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2025-03-08 17:08:07,164 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 152 [2025-03-08 17:08:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2025-03-08 17:08:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2025-03-08 17:08:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 17:08:07,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:07,166 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:07,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:08:07,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -498953617, now seen corresponding path program 1 times [2025-03-08 17:08:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:07,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149712732] [2025-03-08 17:08:07,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:07,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 17:08:07,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 17:08:07,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:07,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149712732] [2025-03-08 17:08:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149712732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:08,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:08:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045599128] [2025-03-08 17:08:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:08,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:08:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:08,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:08:08,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:08,456 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:09,145 INFO L93 Difference]: Finished difference Result 500 states and 713 transitions. [2025-03-08 17:08:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2025-03-08 17:08:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:09,147 INFO L225 Difference]: With dead ends: 500 [2025-03-08 17:08:09,148 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 17:08:09,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:09,149 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 268 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 632 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:08:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 17:08:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 244. [2025-03-08 17:08:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 348 transitions. [2025-03-08 17:08:09,169 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 348 transitions. Word has length 152 [2025-03-08 17:08:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:09,170 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 348 transitions. [2025-03-08 17:08:09,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2025-03-08 17:08:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 17:08:09,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:09,171 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:09,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:08:09,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -784329245, now seen corresponding path program 1 times [2025-03-08 17:08:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819835412] [2025-03-08 17:08:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:09,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 17:08:09,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 17:08:09,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:09,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819835412] [2025-03-08 17:08:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819835412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:08:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079442442] [2025-03-08 17:08:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:10,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:08:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:10,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:08:10,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:08:10,498 INFO L87 Difference]: Start difference. First operand 244 states and 348 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 17:08:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:11,188 INFO L93 Difference]: Finished difference Result 479 states and 679 transitions. [2025-03-08 17:08:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:08:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2025-03-08 17:08:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:11,190 INFO L225 Difference]: With dead ends: 479 [2025-03-08 17:08:11,190 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 17:08:11,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:08:11,193 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 424 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:11,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 530 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:08:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 17:08:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 301. [2025-03-08 17:08:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 264 states have (on average 1.356060606060606) internal successors, (358), 264 states have internal predecessors, (358), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2025-03-08 17:08:11,233 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 152 [2025-03-08 17:08:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2025-03-08 17:08:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 17:08:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2025-03-08 17:08:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:11,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:11,235 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:11,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:08:11,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 318582545, now seen corresponding path program 1 times [2025-03-08 17:08:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316421027] [2025-03-08 17:08:11,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:11,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:11,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:11,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:11,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316421027] [2025-03-08 17:08:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316421027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:08:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310908545] [2025-03-08 17:08:12,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:12,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:08:12,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:12,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:08:12,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:12,607 INFO L87 Difference]: Start difference. First operand 301 states and 426 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:13,016 INFO L93 Difference]: Finished difference Result 495 states and 708 transitions. [2025-03-08 17:08:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:13,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 17:08:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:13,018 INFO L225 Difference]: With dead ends: 495 [2025-03-08 17:08:13,018 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 17:08:13,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:08:13,019 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 246 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 467 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 17:08:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 241. [2025-03-08 17:08:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 204 states have internal predecessors, (270), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2025-03-08 17:08:13,042 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 154 [2025-03-08 17:08:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2025-03-08 17:08:13,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2025-03-08 17:08:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:13,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:13,044 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:13,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:08:13,044 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:13,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash -854158559, now seen corresponding path program 1 times [2025-03-08 17:08:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833566512] [2025-03-08 17:08:13,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:13,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:13,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:13,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:13,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833566512] [2025-03-08 17:08:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833566512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:13,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:08:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318733884] [2025-03-08 17:08:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:13,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:08:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:13,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:08:13,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:08:13,107 INFO L87 Difference]: Start difference. First operand 241 states and 338 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:13,137 INFO L93 Difference]: Finished difference Result 408 states and 574 transitions. [2025-03-08 17:08:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:08:13,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 17:08:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:13,139 INFO L225 Difference]: With dead ends: 408 [2025-03-08 17:08:13,139 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 17:08:13,139 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 17:08:13,139 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:13,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:08:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 17:08:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-08 17:08:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 206 states have internal predecessors, (272), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 340 transitions. [2025-03-08 17:08:13,167 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 340 transitions. Word has length 154 [2025-03-08 17:08:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:13,168 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 340 transitions. [2025-03-08 17:08:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 340 transitions. [2025-03-08 17:08:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:13,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:13,169 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:08:13,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2116452566, now seen corresponding path program 1 times [2025-03-08 17:08:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693879968] [2025-03-08 17:08:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:13,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:13,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693879968] [2025-03-08 17:08:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693879968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:08:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060495227] [2025-03-08 17:08:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:13,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:08:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:13,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:08:13,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:08:13,785 INFO L87 Difference]: Start difference. First operand 243 states and 340 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:14,211 INFO L93 Difference]: Finished difference Result 521 states and 725 transitions. [2025-03-08 17:08:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 17:08:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:14,213 INFO L225 Difference]: With dead ends: 521 [2025-03-08 17:08:14,213 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 17:08:14,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:14,213 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 385 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:14,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 361 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:08:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 17:08:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2025-03-08 17:08:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 252 states have (on average 1.3174603174603174) internal successors, (332), 252 states have internal predecessors, (332), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 400 transitions. [2025-03-08 17:08:14,241 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 400 transitions. Word has length 154 [2025-03-08 17:08:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 400 transitions. [2025-03-08 17:08:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 400 transitions. [2025-03-08 17:08:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:14,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:14,243 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:08:14,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash -349633723, now seen corresponding path program 1 times [2025-03-08 17:08:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631683282] [2025-03-08 17:08:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:14,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:14,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:14,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:14,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631683282] [2025-03-08 17:08:14,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631683282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:14,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:08:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251648842] [2025-03-08 17:08:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:08:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:08:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:08:14,306 INFO L87 Difference]: Start difference. First operand 289 states and 400 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:14,337 INFO L93 Difference]: Finished difference Result 473 states and 661 transitions. [2025-03-08 17:08:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:08:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 17:08:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:14,340 INFO L225 Difference]: With dead ends: 473 [2025-03-08 17:08:14,340 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 17:08:14,340 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 17:08:14,341 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:14,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:08:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 17:08:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-08 17:08:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 254 states have (on average 1.31496062992126) internal successors, (334), 254 states have internal predecessors, (334), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2025-03-08 17:08:14,365 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 154 [2025-03-08 17:08:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:14,367 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-03-08 17:08:14,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2025-03-08 17:08:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:14,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:14,368 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:14,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:08:14,369 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:14,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1758408518, now seen corresponding path program 1 times [2025-03-08 17:08:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15758628] [2025-03-08 17:08:14,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:14,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15758628] [2025-03-08 17:08:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15758628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:14,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:14,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:08:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671768119] [2025-03-08 17:08:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:14,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:08:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:14,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:08:14,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:08:14,945 INFO L87 Difference]: Start difference. First operand 291 states and 402 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:15,240 INFO L93 Difference]: Finished difference Result 296 states and 407 transitions. [2025-03-08 17:08:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 17:08:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:15,241 INFO L225 Difference]: With dead ends: 296 [2025-03-08 17:08:15,242 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 17:08:15,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:08:15,246 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 236 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 526 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 17:08:15,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 526 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:08:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 17:08:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-08 17:08:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.311284046692607) internal successors, (337), 257 states have internal predecessors, (337), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 405 transitions. [2025-03-08 17:08:15,271 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 405 transitions. Word has length 154 [2025-03-08 17:08:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 405 transitions. [2025-03-08 17:08:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 405 transitions. [2025-03-08 17:08:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:08:15,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:15,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:15,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 17:08:15,272 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:15,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1757484997, now seen corresponding path program 1 times [2025-03-08 17:08:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457905154] [2025-03-08 17:08:15,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:15,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:15,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:15,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:15,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:08:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457905154] [2025-03-08 17:08:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457905154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:08:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816435721] [2025-03-08 17:08:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:08:16,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:08:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:08:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:08:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:08:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:17,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 17:08:17,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:08:17,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2025-03-08 17:08:17,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2025-03-08 17:08:17,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2025-03-08 17:08:18,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 75 [2025-03-08 17:08:18,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2025-03-08 17:08:19,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2025-03-08 17:08:19,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81 [2025-03-08 17:08:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2025-03-08 17:08:20,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2025-03-08 17:08:20,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2025-03-08 17:08:21,541 INFO L349 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2025-03-08 17:08:21,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 109 [2025-03-08 17:08:22,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:08:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 462 treesize of output 382 [2025-03-08 17:08:22,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2025-03-08 17:08:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 17:08:22,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:08:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816435721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:08:23,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:08:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 27 [2025-03-08 17:08:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213689098] [2025-03-08 17:08:23,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 17:08:23,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:08:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:23,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:08:23,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:08:23,046 INFO L87 Difference]: Start difference. First operand 294 states and 405 transitions. Second operand has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-08 17:08:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:27,872 INFO L93 Difference]: Finished difference Result 515 states and 696 transitions. [2025-03-08 17:08:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 17:08:27,873 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) Word has length 154 [2025-03-08 17:08:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:27,874 INFO L225 Difference]: With dead ends: 515 [2025-03-08 17:08:27,874 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 17:08:27,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 17:08:27,875 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 137 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:27,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 753 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 17:08:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 17:08:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2025-03-08 17:08:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 255 states have (on average 1.2941176470588236) internal successors, (330), 255 states have internal predecessors, (330), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2025-03-08 17:08:27,913 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 154 [2025-03-08 17:08:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2025-03-08 17:08:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 15 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 13 states have call predecessors, (34), 15 states have call successors, (34) [2025-03-08 17:08:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2025-03-08 17:08:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:27,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:27,914 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:27,924 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 17:08:28,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:28,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:28,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1851751244, now seen corresponding path program 1 times [2025-03-08 17:08:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801545868] [2025-03-08 17:08:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:28,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:28,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:28,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:28,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801545868] [2025-03-08 17:08:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801545868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:08:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436926819] [2025-03-08 17:08:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:30,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:08:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:30,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:08:30,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:08:30,057 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:30,815 INFO L93 Difference]: Finished difference Result 618 states and 836 transitions. [2025-03-08 17:08:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 17:08:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:30,818 INFO L225 Difference]: With dead ends: 618 [2025-03-08 17:08:30,818 INFO L226 Difference]: Without dead ends: 431 [2025-03-08 17:08:30,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:08:30,819 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 333 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:30,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 369 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:08:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-08 17:08:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2025-03-08 17:08:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 319 states have (on average 1.3103448275862069) internal successors, (418), 319 states have internal predecessors, (418), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 486 transitions. [2025-03-08 17:08:30,882 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 486 transitions. Word has length 156 [2025-03-08 17:08:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 486 transitions. [2025-03-08 17:08:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 486 transitions. [2025-03-08 17:08:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:30,883 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 17:08:30,883 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 498441547, now seen corresponding path program 1 times [2025-03-08 17:08:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815315829] [2025-03-08 17:08:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:30,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:30,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815315829] [2025-03-08 17:08:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815315829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:08:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213390432] [2025-03-08 17:08:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:31,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:08:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:31,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:08:31,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:08:31,656 INFO L87 Difference]: Start difference. First operand 362 states and 486 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:32,060 INFO L93 Difference]: Finished difference Result 654 states and 891 transitions. [2025-03-08 17:08:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 17:08:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:32,062 INFO L225 Difference]: With dead ends: 654 [2025-03-08 17:08:32,062 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 17:08:32,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:08:32,063 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 158 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:32,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 410 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 17:08:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2025-03-08 17:08:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 325 states have (on average 1.3107692307692307) internal successors, (426), 325 states have internal predecessors, (426), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 494 transitions. [2025-03-08 17:08:32,105 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 494 transitions. Word has length 156 [2025-03-08 17:08:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:32,105 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 494 transitions. [2025-03-08 17:08:32,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 494 transitions. [2025-03-08 17:08:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:32,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:32,106 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:32,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 17:08:32,106 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:32,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1144866740, now seen corresponding path program 1 times [2025-03-08 17:08:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650941142] [2025-03-08 17:08:32,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:32,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:32,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:32,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:32,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650941142] [2025-03-08 17:08:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650941142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:08:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864157121] [2025-03-08 17:08:33,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:33,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:08:33,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:33,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:08:33,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:08:33,734 INFO L87 Difference]: Start difference. First operand 368 states and 494 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:34,322 INFO L93 Difference]: Finished difference Result 746 states and 1015 transitions. [2025-03-08 17:08:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:08:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 17:08:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:34,324 INFO L225 Difference]: With dead ends: 746 [2025-03-08 17:08:34,324 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 17:08:34,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:08:34,325 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 583 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:34,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 424 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:08:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 17:08:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 396. [2025-03-08 17:08:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 353 states have (on average 1.3059490084985836) internal successors, (461), 353 states have internal predecessors, (461), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 17:08:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2025-03-08 17:08:34,370 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 156 [2025-03-08 17:08:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:34,370 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2025-03-08 17:08:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2025-03-08 17:08:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:34,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:34,371 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 17:08:34,372 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -785899171, now seen corresponding path program 1 times [2025-03-08 17:08:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647437729] [2025-03-08 17:08:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:34,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:34,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:34,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:34,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647437729] [2025-03-08 17:08:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647437729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:08:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957854594] [2025-03-08 17:08:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:08:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:08:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:08:37,531 INFO L87 Difference]: Start difference. First operand 396 states and 529 transitions. Second operand has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 17:08:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:39,033 INFO L93 Difference]: Finished difference Result 1039 states and 1413 transitions. [2025-03-08 17:08:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:08:39,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 156 [2025-03-08 17:08:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:39,036 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 17:08:39,036 INFO L226 Difference]: Without dead ends: 804 [2025-03-08 17:08:39,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:08:39,037 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 568 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:39,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 829 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 17:08:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-08 17:08:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2025-03-08 17:08:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 724 states have (on average 1.3135359116022098) internal successors, (951), 725 states have internal predecessors, (951), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 17:08:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1073 transitions. [2025-03-08 17:08:39,115 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1073 transitions. Word has length 156 [2025-03-08 17:08:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:39,115 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1073 transitions. [2025-03-08 17:08:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 17:08:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1073 transitions. [2025-03-08 17:08:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:39,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:39,120 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 17:08:39,120 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:39,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 939581726, now seen corresponding path program 1 times [2025-03-08 17:08:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987827868] [2025-03-08 17:08:39,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:39,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987827868] [2025-03-08 17:08:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987827868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:08:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836677932] [2025-03-08 17:08:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:08:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:39,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:08:39,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:08:39,973 INFO L87 Difference]: Start difference. First operand 796 states and 1073 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:40,386 INFO L93 Difference]: Finished difference Result 1367 states and 1872 transitions. [2025-03-08 17:08:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:08:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 17:08:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:40,389 INFO L225 Difference]: With dead ends: 1367 [2025-03-08 17:08:40,391 INFO L226 Difference]: Without dead ends: 754 [2025-03-08 17:08:40,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:08:40,392 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:40,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 676 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-08 17:08:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-08 17:08:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 682 states have (on average 1.3181818181818181) internal successors, (899), 683 states have internal predecessors, (899), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 17:08:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1021 transitions. [2025-03-08 17:08:40,475 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1021 transitions. Word has length 156 [2025-03-08 17:08:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:40,475 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1021 transitions. [2025-03-08 17:08:40,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 17:08:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1021 transitions. [2025-03-08 17:08:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:08:40,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:40,476 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 17:08:40,476 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1437218740, now seen corresponding path program 1 times [2025-03-08 17:08:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610430478] [2025-03-08 17:08:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:40,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:08:40,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:08:40,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:40,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:08:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610430478] [2025-03-08 17:08:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610430478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:08:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:08:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:08:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680736441] [2025-03-08 17:08:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:08:40,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:08:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:08:40,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:08:40,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:08:40,750 INFO L87 Difference]: Start difference. First operand 754 states and 1021 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:08:41,159 INFO L93 Difference]: Finished difference Result 1578 states and 2150 transitions. [2025-03-08 17:08:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:08:41,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-08 17:08:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:08:41,162 INFO L225 Difference]: With dead ends: 1578 [2025-03-08 17:08:41,163 INFO L226 Difference]: Without dead ends: 929 [2025-03-08 17:08:41,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:08:41,164 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 130 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:08:41,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 653 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:08:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-08 17:08:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 753. [2025-03-08 17:08:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 681 states have (on average 1.315712187958884) internal successors, (896), 682 states have internal predecessors, (896), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 17:08:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1018 transitions. [2025-03-08 17:08:41,244 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1018 transitions. Word has length 156 [2025-03-08 17:08:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:08:41,244 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1018 transitions. [2025-03-08 17:08:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:08:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1018 transitions. [2025-03-08 17:08:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 17:08:41,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:08:41,245 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:08:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 17:08:41,245 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:08:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:08:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1305511662, now seen corresponding path program 1 times [2025-03-08 17:08:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:08:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453987767] [2025-03-08 17:08:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:08:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:08:41,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:08:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:08:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:08:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453987767] [2025-03-08 17:08:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453987767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:08:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665447427] [2025-03-08 17:08:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:08:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:08:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:08:45,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:08:45,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:08:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:08:45,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:08:45,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:08:45,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:08:45,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 17:08:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:08:48,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 17:08:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-03-08 17:08:48,474 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2025-03-08 17:08:48,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 110 [2025-03-08 17:08:48,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-03-08 17:08:48,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,625 INFO L349 Elim1Store]: treesize reduction 196, result has 18.7 percent of original size [2025-03-08 17:08:48,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 272 [2025-03-08 17:08:48,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,693 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-03-08 17:08:48,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 76 [2025-03-08 17:08:48,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,754 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-03-08 17:08:48,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 76 [2025-03-08 17:08:48,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:48,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:48,811 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:48,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2025-03-08 17:08:49,914 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 17:08:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 36 [2025-03-08 17:08:49,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:49,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:49,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 123 [2025-03-08 17:08:50,053 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-08 17:08:50,099 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,106 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-08 17:08:50,156 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,167 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2025-03-08 17:08:50,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2025-03-08 17:08:50,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-03-08 17:08:50,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,251 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:08:50,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2025-03-08 17:08:50,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:08:50,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2025-03-08 17:08:51,166 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-03-08 17:08:51,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 88 [2025-03-08 17:08:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:08:51,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:08:52,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (store |c_#memory_int| c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset 2)) c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse5 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse5 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse2 (select (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse1 (mod .cse2 256))) (or (< 127 .cse1) (not (= .cse2 (select (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse1 (select (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse7 (let ((.cse10 (let ((.cse11 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse11 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse11 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse6 (select (select .cse7 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse8 (mod .cse6 256)) (.cse9 (select (select .cse7 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (or (not (= .cse6 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse8 .cse9) (= .cse8 (+ 256 .cse9))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse16 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse16 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse16 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse12 (select (select .cse13 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse14 (mod .cse12 256))) (or (not (= .cse12 (select (select .cse13 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse14 128) (= .cse14 (+ 256 (select (select .cse13 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))))) is different from false [2025-03-08 17:08:52,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base)) (.cse0 (mod |c_ULTIMATE.start_step_#t~ite18#1| 256))) (and (or (< 127 .cse0) (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse19 c_~WrapperStruct00_var_1_8_Pointer~0.offset .cse0)))) (let ((.cse1 (select (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset 2)) c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse3 (let ((.cse6 (let ((.cse7 (store (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse7 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse7 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse2 (select (select .cse3 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse4 (mod .cse2 256)) (.cse5 (select (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (or (not (= .cse2 (select (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse4 .cse5) (= .cse4 (+ 256 .cse5))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse11 (let ((.cse12 (let ((.cse13 (store (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse13 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse13 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse12 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse10 (select (select .cse11 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse9 (mod .cse10 256))) (or (< .cse9 128) (not (= .cse10 (select (select .cse11 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse9 (+ 256 (select (select .cse11 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store (store .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse18 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse18 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse17 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse15 (select (select .cse16 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse14 (mod .cse15 256))) (or (< 127 .cse14) (not (= .cse15 (select (select .cse16 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse14 (select (select .cse16 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))))))))))))) (or (< .cse0 128) (let ((.cse27 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse19 c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (- 256) .cse0))))) (let ((.cse20 (select (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset 2)) c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse22 (let ((.cse25 (let ((.cse26 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse26 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse21 (select (select .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse24 (mod .cse21 256)) (.cse23 (select (select .cse22 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (or (not (= .cse21 (select (select .cse22 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse23 .cse24) (= .cse24 (+ 256 .cse23))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse29 (let ((.cse31 (let ((.cse32 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse32 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse32 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse32 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse31 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse31 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse28 (select (select .cse29 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse30 (mod .cse28 256))) (or (not (= .cse28 (select (select .cse29 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse30 128) (= .cse30 (+ 256 (select (select .cse29 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse34 (let ((.cse36 (let ((.cse37 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse37 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse37 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse37 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse36 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse36 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse33 (select (select .cse34 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse35 (mod .cse33 256))) (or (not (= .cse33 (select (select .cse34 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= (select (select .cse34 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) .cse35) (< 127 .cse35)))))) (not (= (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)))))))))) is different from false [2025-03-08 17:08:52,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base)) (.cse19 (mod (select (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset) 256))) (and (or (let ((.cse6 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (- 256) .cse19))))) (let ((.cse0 (select (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset 2)) c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse1 (let ((.cse4 (let ((.cse5 (store (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse5 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse5 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse3 (select (select .cse1 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse2 (mod .cse3 256))) (or (= (+ 256 (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) .cse2) (not (= .cse3 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse2 128)))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse11 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse11 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse9 (select (select .cse8 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse7 (mod .cse9 256))) (or (< 127 .cse7) (= .cse7 (select (select .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (not (= .cse9 (select (select .cse8 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset)))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_3658)) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse15 (let ((.cse16 (let ((.cse17 (store (store .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse17 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse17 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse17 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse14 (select (select .cse15 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse13 (mod .cse14 256)) (.cse12 (select (select .cse15 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (or (= (+ 256 .cse12) .cse13) (= .cse13 .cse12) (not (= .cse14 (select (select .cse15 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))))))))))))) (< .cse19 128)) (or (let ((.cse27 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse18 c_~WrapperStruct00_var_1_8_Pointer~0.offset .cse19)))) (let ((.cse20 (select (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset 2)) c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse24 (let ((.cse25 (let ((.cse26 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse26 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse26 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse25 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse23 (select (select .cse24 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse21 (mod .cse23 256)) (.cse22 (select (select .cse24 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (or (= .cse21 (+ 256 .cse22)) (not (= .cse23 (select (select .cse24 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse21 .cse22)))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse29 (let ((.cse31 (let ((.cse32 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse32 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse32 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse32 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse31 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse31 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse30 (select (select .cse29 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse28 (mod .cse30 256))) (or (= .cse28 (+ 256 (select (select .cse29 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (< .cse28 128) (not (= .cse30 (select (select .cse29 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset)))))))))) (forall ((v_ArrVal_3658 (Array Int Int))) (or (not (= v_ArrVal_3658 (store .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_3658 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (forall ((v_ArrVal_3661 Int) (~WrapperStruct00_var_1_1_Pointer~0.offset Int) (v_ArrVal_3657 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (let ((.cse34 (let ((.cse36 (let ((.cse37 (store (store .cse27 c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_3657) c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_3658))) (store .cse37 c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select .cse37 c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select .cse37 ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset)))))) (store .cse36 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse36 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_3661))))) (let ((.cse33 (select (select .cse34 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) (let ((.cse35 (mod .cse33 256))) (or (not (= .cse33 (select (select .cse34 c_~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (= .cse35 (select (select .cse34 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (< 127 .cse35))))))))))) (< 127 .cse19)))) is different from false