./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 04:09:32,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:09:32,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:09:32,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:09:32,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:09:32,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:09:32,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:09:32,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:09:32,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:09:32,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:09:32,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:09:32,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:09:32,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:09:32,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:09:32,619 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:09:32,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:09:32,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:09:32,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:09:32,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:09:32,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:09:32,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:09:32,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:09:32,622 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-jdk21/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-02-06 04:09:32,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:09:32,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:09:32,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:09:32,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:09:32,870 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:09:32,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2025-02-06 04:09:34,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b959fe09/9c1666dd3a494a82bd4ae3a59fb4cefe/FLAG4023401eb [2025-02-06 04:09:34,276 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:09:34,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i [2025-02-06 04:09:34,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b959fe09/9c1666dd3a494a82bd4ae3a59fb4cefe/FLAG4023401eb [2025-02-06 04:09:34,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b959fe09/9c1666dd3a494a82bd4ae3a59fb4cefe [2025-02-06 04:09:34,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:09:34,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:09:34,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:09:34,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:09:34,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:09:34,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794493ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34, skipping insertion in model container [2025-02-06 04:09:34,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:09:34,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2025-02-06 04:09:34,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:09:34,499 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:09:34,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-88.i[917,930] [2025-02-06 04:09:34,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:09:34,563 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:09:34,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34 WrapperNode [2025-02-06 04:09:34,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:09:34,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:09:34,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:09:34,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:09:34,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,615 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2025-02-06 04:09:34,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:09:34,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:09:34,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:09:34,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:09:34,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,637 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:09:34,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:09:34,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:09:34,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:09:34,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:09:34,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (1/1) ... [2025-02-06 04:09:34,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:09:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:34,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:09:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:09:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:09:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:09:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:09:34,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:09:34,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:09:34,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:09:34,813 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:09:34,815 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:09:35,250 INFO L1309 $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-02-06 04:09:35,305 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-06 04:09:35,306 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:09:35,321 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:09:35,323 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:09:35,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:09:35 BoogieIcfgContainer [2025-02-06 04:09:35,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:09:35,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:09:35,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:09:35,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:09:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:09:34" (1/3) ... [2025-02-06 04:09:35,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3acd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:09:35, skipping insertion in model container [2025-02-06 04:09:35,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:34" (2/3) ... [2025-02-06 04:09:35,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3acd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:09:35, skipping insertion in model container [2025-02-06 04:09:35,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:09:35" (3/3) ... [2025-02-06 04:09:35,333 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-88.i [2025-02-06 04:09:35,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:09:35,348 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-02-06 04:09:35,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:09:35,406 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;@134dad4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:09:35,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:09:35,410 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-02-06 04:09:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:09:35,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:35,422 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-02-06 04:09:35,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1534683364, now seen corresponding path program 1 times [2025-02-06 04:09:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16769101] [2025-02-06 04:09:35,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:35,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:35,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:35,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:35,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 04:09:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16769101] [2025-02-06 04:09:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16769101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:09:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715987557] [2025-02-06 04:09:35,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:35,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:35,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:35,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:09:35,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:09:35,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:36,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:36,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:36,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:36,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:09:36,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 04:09:36,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:09:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715987557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:09:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:09:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659426228] [2025-02-06 04:09:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:09:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:36,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:09:36,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:09:36,051 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-02-06 04:09:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:36,075 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-02-06 04:09:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:09:36,077 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-02-06 04:09:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:36,081 INFO L225 Difference]: With dead ends: 230 [2025-02-06 04:09:36,082 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 04:09:36,084 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-02-06 04:09:36,086 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-02-06 04:09:36,086 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-02-06 04:09:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 04:09:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-06 04:09:36,133 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-02-06 04:09:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-02-06 04:09:36,140 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-02-06 04:09:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:36,140 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-02-06 04:09:36,140 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-02-06 04:09:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-02-06 04:09:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:09:36,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:36,143 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-02-06 04:09:36,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:09:36,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:09:36,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:36,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash -186126055, now seen corresponding path program 1 times [2025-02-06 04:09:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:36,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870651747] [2025-02-06 04:09:36,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:36,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:36,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:36,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870651747] [2025-02-06 04:09:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870651747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:36,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:36,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91620989] [2025-02-06 04:09:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:36,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:36,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:36,653 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-02-06 04:09:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:36,704 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-02-06 04:09:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:36,705 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-02-06 04:09:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:36,706 INFO L225 Difference]: With dead ends: 230 [2025-02-06 04:09:36,706 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 04:09:36,707 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-02-06 04:09:36,707 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-02-06 04:09:36,708 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-02-06 04:09:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 04:09:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-06 04:09:36,718 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-02-06 04:09:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-02-06 04:09:36,719 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-02-06 04:09:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-02-06 04:09:36,720 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-02-06 04:09:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-02-06 04:09:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:09:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:36,724 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-02-06 04:09:36,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:09:36,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:36,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1993580518, now seen corresponding path program 1 times [2025-02-06 04:09:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499404819] [2025-02-06 04:09:36,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:36,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:36,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:36,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499404819] [2025-02-06 04:09:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499404819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:36,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668791013] [2025-02-06 04:09:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:36,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:36,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:36,886 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-02-06 04:09:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:36,939 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-02-06 04:09:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:36,940 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-02-06 04:09:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:36,941 INFO L225 Difference]: With dead ends: 234 [2025-02-06 04:09:36,941 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 04:09:36,942 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-02-06 04:09:36,942 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-02-06 04:09:36,943 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-02-06 04:09:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 04:09:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-06 04:09:36,952 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-02-06 04:09:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-02-06 04:09:36,954 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-02-06 04:09:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:36,955 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-02-06 04:09:36,956 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-02-06 04:09:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-02-06 04:09:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:09:36,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:36,960 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-02-06 04:09:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:09:36,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:36,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1106076837, now seen corresponding path program 1 times [2025-02-06 04:09:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194703054] [2025-02-06 04:09:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:36,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:37,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194703054] [2025-02-06 04:09:37,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194703054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:37,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:37,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570436511] [2025-02-06 04:09:37,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:37,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:37,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:37,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:37,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:37,151 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-02-06 04:09:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:37,177 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-02-06 04:09:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:37,177 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-02-06 04:09:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:37,187 INFO L225 Difference]: With dead ends: 238 [2025-02-06 04:09:37,188 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 04:09:37,189 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-02-06 04:09:37,190 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-02-06 04:09:37,192 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-02-06 04:09:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 04:09:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-02-06 04:09:37,205 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-02-06 04:09:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-02-06 04:09:37,206 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-02-06 04:09:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-02-06 04:09:37,208 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-02-06 04:09:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-02-06 04:09:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:09:37,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:37,210 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-02-06 04:09:37,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:09:37,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:37,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1105153316, now seen corresponding path program 1 times [2025-02-06 04:09:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229485106] [2025-02-06 04:09:37,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:37,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:09:37,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:09:37,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:37,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:39,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229485106] [2025-02-06 04:09:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229485106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:39,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:09:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542635357] [2025-02-06 04:09:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:39,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:39,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:39,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:39,124 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-02-06 04:09:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:39,718 INFO L93 Difference]: Finished difference Result 303 states and 436 transitions. [2025-02-06 04:09:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:39,718 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-02-06 04:09:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:39,720 INFO L225 Difference]: With dead ends: 303 [2025-02-06 04:09:39,720 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 04:09:39,720 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-02-06 04:09:39,721 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-02-06 04:09:39,721 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-02-06 04:09:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 04:09:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2025-02-06 04:09:39,739 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-02-06 04:09:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-02-06 04:09:39,740 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 143 [2025-02-06 04:09:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-02-06 04:09:39,741 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-02-06 04:09:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-02-06 04:09:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:09:39,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:39,742 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-02-06 04:09:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:09:39,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:39,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash 845832442, now seen corresponding path program 1 times [2025-02-06 04:09:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612289758] [2025-02-06 04:09:39,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:39,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:09:39,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:09:39,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:39,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612289758] [2025-02-06 04:09:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612289758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:09:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158692864] [2025-02-06 04:09:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:41,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:41,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:41,344 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-02-06 04:09:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:41,834 INFO L93 Difference]: Finished difference Result 335 states and 484 transitions. [2025-02-06 04:09:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:41,835 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-02-06 04:09:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:41,836 INFO L225 Difference]: With dead ends: 335 [2025-02-06 04:09:41,836 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 04:09:41,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:09:41,838 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:41,839 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.3s Time] [2025-02-06 04:09:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 04:09:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2025-02-06 04:09:41,852 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-02-06 04:09:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2025-02-06 04:09:41,855 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 145 [2025-02-06 04:09:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:41,856 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2025-02-06 04:09:41,856 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-02-06 04:09:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2025-02-06 04:09:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:09:41,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:41,857 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-02-06 04:09:41,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:09:41,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1241611270, now seen corresponding path program 1 times [2025-02-06 04:09:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705368921] [2025-02-06 04:09:41,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:41,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:09:41,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:09:41,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705368921] [2025-02-06 04:09:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705368921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:09:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157754799] [2025-02-06 04:09:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:09:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:43,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:09:43,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:09:43,301 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-02-06 04:09:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:44,040 INFO L93 Difference]: Finished difference Result 351 states and 508 transitions. [2025-02-06 04:09:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:44,040 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-02-06 04:09:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:44,042 INFO L225 Difference]: With dead ends: 351 [2025-02-06 04:09:44,042 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 04:09:44,042 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-02-06 04:09:44,043 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-02-06 04:09:44,044 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-02-06 04:09:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 04:09:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 141. [2025-02-06 04:09:44,058 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-02-06 04:09:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-02-06 04:09:44,059 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2025-02-06 04:09:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:44,059 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-02-06 04:09:44,060 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-02-06 04:09:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-02-06 04:09:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:09:44,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:44,061 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-02-06 04:09:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:09:44,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607274, now seen corresponding path program 1 times [2025-02-06 04:09:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233978907] [2025-02-06 04:09:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:44,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:09:44,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:09:44,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:44,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:09:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233978907] [2025-02-06 04:09:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233978907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:09:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642943160] [2025-02-06 04:09:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:44,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:44,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:09:44,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:09:44,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:09:44,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:09:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:09:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:44,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:09:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642943160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:09:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 04:09:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715994375] [2025-02-06 04:09:44,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:44,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:09:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:44,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:09:44,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:44,451 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-02-06 04:09:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:44,482 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-02-06 04:09:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:09:44,482 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-02-06 04:09:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:44,483 INFO L225 Difference]: With dead ends: 282 [2025-02-06 04:09:44,483 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 04:09:44,483 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-02-06 04:09:44,484 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-02-06 04:09:44,484 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-02-06 04:09:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 04:09:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 04:09:44,494 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-02-06 04:09:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2025-02-06 04:09:44,495 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 145 [2025-02-06 04:09:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:44,496 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2025-02-06 04:09:44,496 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-02-06 04:09:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2025-02-06 04:09:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:09:44,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:44,498 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-02-06 04:09:44,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:09:44,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:44,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2109488439, now seen corresponding path program 1 times [2025-02-06 04:09:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614989981] [2025-02-06 04:09:44,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:44,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:09:44,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:09:44,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:44,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614989981] [2025-02-06 04:09:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614989981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:09:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269388895] [2025-02-06 04:09:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:45,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:09:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:09:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:09:45,660 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-02-06 04:09:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:46,233 INFO L93 Difference]: Finished difference Result 348 states and 498 transitions. [2025-02-06 04:09:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:09:46,234 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-02-06 04:09:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:46,235 INFO L225 Difference]: With dead ends: 348 [2025-02-06 04:09:46,235 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 04:09:46,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:09:46,236 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-02-06 04:09:46,236 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-02-06 04:09:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 04:09:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2025-02-06 04:09:46,248 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-02-06 04:09:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2025-02-06 04:09:46,249 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 146 [2025-02-06 04:09:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2025-02-06 04:09:46,249 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-02-06 04:09:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2025-02-06 04:09:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 04:09:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:46,250 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-02-06 04:09:46,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:09:46,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1049961112, now seen corresponding path program 1 times [2025-02-06 04:09:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238261476] [2025-02-06 04:09:46,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 04:09:46,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 04:09:46,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:46,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238261476] [2025-02-06 04:09:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238261476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:47,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:09:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157723815] [2025-02-06 04:09:47,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:09:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:47,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:09:47,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:09:47,767 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-02-06 04:09:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:48,339 INFO L93 Difference]: Finished difference Result 325 states and 472 transitions. [2025-02-06 04:09:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:48,339 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-02-06 04:09:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:48,342 INFO L225 Difference]: With dead ends: 325 [2025-02-06 04:09:48,342 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 04:09:48,342 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-02-06 04:09:48,343 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 316 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-06 04:09:48,343 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-02-06 04:09:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 04:09:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2025-02-06 04:09:48,354 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-02-06 04:09:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2025-02-06 04:09:48,357 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 147 [2025-02-06 04:09:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:48,357 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2025-02-06 04:09:48,357 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-02-06 04:09:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2025-02-06 04:09:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 04:09:48,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:48,359 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-02-06 04:09:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:09:48,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1100012089, now seen corresponding path program 1 times [2025-02-06 04:09:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918986538] [2025-02-06 04:09:48,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:48,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 04:09:48,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 04:09:48,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918986538] [2025-02-06 04:09:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918986538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845955939] [2025-02-06 04:09:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:48,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:48,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:48,908 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-02-06 04:09:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:49,160 INFO L93 Difference]: Finished difference Result 430 states and 622 transitions. [2025-02-06 04:09:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:49,161 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-02-06 04:09:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:49,163 INFO L225 Difference]: With dead ends: 430 [2025-02-06 04:09:49,163 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 04:09:49,163 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-02-06 04:09:49,165 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-02-06 04:09:49,165 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-02-06 04:09:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 04:09:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 227. [2025-02-06 04:09:49,187 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-02-06 04:09:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-02-06 04:09:49,188 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 147 [2025-02-06 04:09:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:49,189 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-02-06 04:09:49,189 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-02-06 04:09:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-02-06 04:09:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 04:09:49,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:49,190 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-02-06 04:09:49,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:09:49,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:49,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -633053946, now seen corresponding path program 1 times [2025-02-06 04:09:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472249655] [2025-02-06 04:09:49,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 04:09:49,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 04:09:49,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:49,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472249655] [2025-02-06 04:09:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472249655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:49,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327815986] [2025-02-06 04:09:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:49,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:49,487 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-02-06 04:09:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:49,714 INFO L93 Difference]: Finished difference Result 463 states and 669 transitions. [2025-02-06 04:09:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:49,714 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-02-06 04:09:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:49,716 INFO L225 Difference]: With dead ends: 463 [2025-02-06 04:09:49,716 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 04:09:49,717 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-02-06 04:09:49,717 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-02-06 04:09:49,717 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-02-06 04:09:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 04:09:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 229. [2025-02-06 04:09:49,755 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-02-06 04:09:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2025-02-06 04:09:49,757 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 149 [2025-02-06 04:09:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:49,757 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2025-02-06 04:09:49,757 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-02-06 04:09:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2025-02-06 04:09:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:09:49,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:49,759 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-02-06 04:09:49,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:09:49,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:49,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash -240134859, now seen corresponding path program 1 times [2025-02-06 04:09:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407888308] [2025-02-06 04:09:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:49,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:09:49,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:09:49,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:50,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407888308] [2025-02-06 04:09:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407888308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:09:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543710663] [2025-02-06 04:09:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:50,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:09:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:50,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:09:50,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:09:50,042 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-02-06 04:09:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:50,190 INFO L93 Difference]: Finished difference Result 412 states and 589 transitions. [2025-02-06 04:09:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:09:50,191 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-02-06 04:09:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:50,192 INFO L225 Difference]: With dead ends: 412 [2025-02-06 04:09:50,192 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 04:09:50,193 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-02-06 04:09:50,193 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-02-06 04:09:50,193 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-02-06 04:09:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 04:09:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2025-02-06 04:09:50,221 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-02-06 04:09:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2025-02-06 04:09:50,222 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 151 [2025-02-06 04:09:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:50,223 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2025-02-06 04:09:50,223 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-02-06 04:09:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2025-02-06 04:09:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:09:50,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:50,224 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-02-06 04:09:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:09:50,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2016776148, now seen corresponding path program 1 times [2025-02-06 04:09:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467182417] [2025-02-06 04:09:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:09:50,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:09:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467182417] [2025-02-06 04:09:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467182417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:09:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324597227] [2025-02-06 04:09:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:50,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:09:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:50,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:09:50,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:09:50,566 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-02-06 04:09:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:50,874 INFO L93 Difference]: Finished difference Result 443 states and 633 transitions. [2025-02-06 04:09:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:50,875 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-02-06 04:09:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:50,876 INFO L225 Difference]: With dead ends: 443 [2025-02-06 04:09:50,876 INFO L226 Difference]: Without dead ends: 296 [2025-02-06 04:09:50,877 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-02-06 04:09:50,877 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:50,878 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.3s Time] [2025-02-06 04:09:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-06 04:09:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 240. [2025-02-06 04:09:50,905 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-02-06 04:09:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 342 transitions. [2025-02-06 04:09:50,906 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 342 transitions. Word has length 151 [2025-02-06 04:09:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:50,906 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 342 transitions. [2025-02-06 04:09:50,907 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-02-06 04:09:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 342 transitions. [2025-02-06 04:09:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 04:09:50,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:50,909 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-02-06 04:09:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:09:50,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1883712145, now seen corresponding path program 1 times [2025-02-06 04:09:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318811904] [2025-02-06 04:09:50,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:50,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 04:09:50,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 04:09:50,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:50,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318811904] [2025-02-06 04:09:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318811904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:09:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812126013] [2025-02-06 04:09:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:51,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:09:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:09:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:09:51,933 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-02-06 04:09:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:52,455 INFO L93 Difference]: Finished difference Result 467 states and 664 transitions. [2025-02-06 04:09:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:09:52,455 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-02-06 04:09:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:52,457 INFO L225 Difference]: With dead ends: 467 [2025-02-06 04:09:52,457 INFO L226 Difference]: Without dead ends: 320 [2025-02-06 04:09:52,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:09:52,457 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-02-06 04:09:52,458 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-02-06 04:09:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-06 04:09:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 236. [2025-02-06 04:09:52,478 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-02-06 04:09:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2025-02-06 04:09:52,479 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 152 [2025-02-06 04:09:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:52,479 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2025-02-06 04:09:52,480 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-02-06 04:09:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2025-02-06 04:09:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 04:09:52,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:52,481 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-02-06 04:09:52,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:09:52,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:52,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -498953617, now seen corresponding path program 1 times [2025-02-06 04:09:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762218633] [2025-02-06 04:09:52,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:52,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 04:09:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 04:09:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762218633] [2025-02-06 04:09:53,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762218633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:53,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:53,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:09:53,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357428633] [2025-02-06 04:09:53,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:53,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:09:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:53,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:09:53,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:09:53,578 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-02-06 04:09:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:54,317 INFO L93 Difference]: Finished difference Result 500 states and 713 transitions. [2025-02-06 04:09:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:09:54,317 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-02-06 04:09:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:54,319 INFO L225 Difference]: With dead ends: 500 [2025-02-06 04:09:54,319 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 04:09:54,319 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-02-06 04:09:54,320 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:54,320 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.6s Time] [2025-02-06 04:09:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 04:09:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 244. [2025-02-06 04:09:54,342 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-02-06 04:09:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 348 transitions. [2025-02-06 04:09:54,343 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 348 transitions. Word has length 152 [2025-02-06 04:09:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:54,343 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 348 transitions. [2025-02-06 04:09:54,343 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-02-06 04:09:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 348 transitions. [2025-02-06 04:09:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 04:09:54,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:54,344 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-02-06 04:09:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:09:54,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -784329245, now seen corresponding path program 1 times [2025-02-06 04:09:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391501320] [2025-02-06 04:09:54,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:54,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 04:09:54,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 04:09:54,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:54,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391501320] [2025-02-06 04:09:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391501320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:55,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:09:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323814559] [2025-02-06 04:09:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:55,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:09:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:55,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:09:55,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:09:55,586 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-02-06 04:09:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:56,192 INFO L93 Difference]: Finished difference Result 479 states and 679 transitions. [2025-02-06 04:09:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:09:56,192 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-02-06 04:09:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:56,194 INFO L225 Difference]: With dead ends: 479 [2025-02-06 04:09:56,194 INFO L226 Difference]: Without dead ends: 330 [2025-02-06 04:09:56,195 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-02-06 04:09:56,195 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-02-06 04:09:56,195 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-02-06 04:09:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-06 04:09:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 301. [2025-02-06 04:09:56,217 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-02-06 04:09:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2025-02-06 04:09:56,218 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 152 [2025-02-06 04:09:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:56,220 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2025-02-06 04:09:56,220 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-02-06 04:09:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2025-02-06 04:09:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:09:56,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:56,221 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-02-06 04:09:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:09:56,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 318582545, now seen corresponding path program 1 times [2025-02-06 04:09:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931200084] [2025-02-06 04:09:56,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:09:56,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:09:56,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931200084] [2025-02-06 04:09:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931200084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:09:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294006000] [2025-02-06 04:09:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:09:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:57,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:09:57,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:09:57,493 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-02-06 04:09:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:57,919 INFO L93 Difference]: Finished difference Result 495 states and 708 transitions. [2025-02-06 04:09:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:09:57,920 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-02-06 04:09:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:57,921 INFO L225 Difference]: With dead ends: 495 [2025-02-06 04:09:57,921 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 04:09:57,921 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-02-06 04:09:57,922 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-02-06 04:09:57,922 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-02-06 04:09:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 04:09:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 241. [2025-02-06 04:09:57,943 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-02-06 04:09:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2025-02-06 04:09:57,945 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 154 [2025-02-06 04:09:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2025-02-06 04:09:57,945 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-02-06 04:09:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2025-02-06 04:09:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:09:57,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:57,946 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-02-06 04:09:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:09:57,946 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -854158559, now seen corresponding path program 1 times [2025-02-06 04:09:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857239655] [2025-02-06 04:09:57,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:09:57,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:09:57,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:57,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857239655] [2025-02-06 04:09:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857239655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:58,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:09:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896313849] [2025-02-06 04:09:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:58,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:09:58,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:09:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:09:58,005 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-02-06 04:09:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:58,034 INFO L93 Difference]: Finished difference Result 408 states and 574 transitions. [2025-02-06 04:09:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:09:58,035 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-02-06 04:09:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:58,036 INFO L225 Difference]: With dead ends: 408 [2025-02-06 04:09:58,036 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 04:09:58,036 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-02-06 04:09:58,037 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-02-06 04:09:58,037 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-02-06 04:09:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 04:09:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-02-06 04:09:58,059 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-02-06 04:09:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 340 transitions. [2025-02-06 04:09:58,061 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 340 transitions. Word has length 154 [2025-02-06 04:09:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:58,061 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 340 transitions. [2025-02-06 04:09:58,062 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-02-06 04:09:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 340 transitions. [2025-02-06 04:09:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:09:58,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:58,063 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-02-06 04:09:58,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:09:58,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2116452566, now seen corresponding path program 1 times [2025-02-06 04:09:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865866106] [2025-02-06 04:09:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:58,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:09:58,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:09:58,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:58,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:58,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865866106] [2025-02-06 04:09:58,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865866106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:58,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:09:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304325390] [2025-02-06 04:09:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:58,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:58,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:58,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:58,718 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-02-06 04:09:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:59,112 INFO L93 Difference]: Finished difference Result 521 states and 725 transitions. [2025-02-06 04:09:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:09:59,112 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-02-06 04:09:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:59,114 INFO L225 Difference]: With dead ends: 521 [2025-02-06 04:09:59,114 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 04:09:59,114 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-02-06 04:09:59,116 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:59,116 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.3s Time] [2025-02-06 04:09:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 04:09:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2025-02-06 04:09:59,144 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-02-06 04:09:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 400 transitions. [2025-02-06 04:09:59,145 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 400 transitions. Word has length 154 [2025-02-06 04:09:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 400 transitions. [2025-02-06 04:09:59,146 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-02-06 04:09:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 400 transitions. [2025-02-06 04:09:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:09:59,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:59,147 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-02-06 04:09:59,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:09:59,147 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:59,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -349633723, now seen corresponding path program 1 times [2025-02-06 04:09:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476348637] [2025-02-06 04:09:59,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:59,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:09:59,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:09:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476348637] [2025-02-06 04:09:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476348637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:09:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116826520] [2025-02-06 04:09:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:59,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:09:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:59,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:09:59,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:09:59,205 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-02-06 04:09:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:59,237 INFO L93 Difference]: Finished difference Result 473 states and 661 transitions. [2025-02-06 04:09:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:09:59,238 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-02-06 04:09:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:59,240 INFO L225 Difference]: With dead ends: 473 [2025-02-06 04:09:59,240 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 04:09:59,241 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-02-06 04:09:59,241 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-02-06 04:09:59,241 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-02-06 04:09:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 04:09:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-02-06 04:09:59,264 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-02-06 04:09:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2025-02-06 04:09:59,266 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 154 [2025-02-06 04:09:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:59,266 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-02-06 04:09:59,266 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-02-06 04:09:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2025-02-06 04:09:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:09:59,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:59,267 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-02-06 04:09:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:09:59,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1758408518, now seen corresponding path program 1 times [2025-02-06 04:09:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221396783] [2025-02-06 04:09:59,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:59,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:09:59,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:09:59,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:59,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:09:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221396783] [2025-02-06 04:09:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221396783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:09:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978877993] [2025-02-06 04:09:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:59,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:59,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:59,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:59,790 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-02-06 04:10:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:00,080 INFO L93 Difference]: Finished difference Result 296 states and 407 transitions. [2025-02-06 04:10:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:00,081 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-02-06 04:10:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:00,082 INFO L225 Difference]: With dead ends: 296 [2025-02-06 04:10:00,082 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 04:10:00,082 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-02-06 04:10:00,085 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-02-06 04:10:00,085 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-02-06 04:10:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 04:10:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-06 04:10:00,112 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-02-06 04:10:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 405 transitions. [2025-02-06 04:10:00,113 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 405 transitions. Word has length 154 [2025-02-06 04:10:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:00,114 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 405 transitions. [2025-02-06 04:10:00,114 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-02-06 04:10:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 405 transitions. [2025-02-06 04:10:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:10:00,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:00,115 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-02-06 04:10:00,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:10:00,115 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1757484997, now seen corresponding path program 1 times [2025-02-06 04:10:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044080319] [2025-02-06 04:10:00,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:10:00,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:10:00,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:00,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:10:01,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044080319] [2025-02-06 04:10:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044080319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824928555] [2025-02-06 04:10:01,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:01,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:01,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:01,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:01,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:10:01,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:10:02,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:10:02,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 04:10:02,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:02,062 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-02-06 04:10:02,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2025-02-06 04:10:02,539 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-02-06 04:10:02,914 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-02-06 04:10:03,283 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-02-06 04:10:03,627 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-02-06 04:10:03,995 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-02-06 04:10:04,655 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-02-06 04:10:05,242 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-02-06 04:10:05,607 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-02-06 04:10:06,299 INFO L349 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2025-02-06 04:10:06,299 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-02-06 04:10:06,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:06,916 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-02-06 04:10:07,048 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-02-06 04:10:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 04:10:07,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824928555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:07,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:10:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 27 [2025-02-06 04:10:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036196463] [2025-02-06 04:10:07,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:10:07,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:10:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:07,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:10:07,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-02-06 04:10:07,785 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-02-06 04:10:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:12,707 INFO L93 Difference]: Finished difference Result 515 states and 696 transitions. [2025-02-06 04:10:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 04:10:12,707 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-02-06 04:10:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:12,709 INFO L225 Difference]: With dead ends: 515 [2025-02-06 04:10:12,709 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 04:10:12,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 04:10:12,710 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:12,711 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.6s Time] [2025-02-06 04:10:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 04:10:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2025-02-06 04:10:12,753 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-02-06 04:10:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2025-02-06 04:10:12,754 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 154 [2025-02-06 04:10:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:12,754 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2025-02-06 04:10:12,754 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-02-06 04:10:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2025-02-06 04:10:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:12,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:12,755 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-02-06 04:10:12,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:10:12,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:12,956 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1851751244, now seen corresponding path program 1 times [2025-02-06 04:10:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704029690] [2025-02-06 04:10:12,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:12,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:13,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:13,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:13,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:14,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704029690] [2025-02-06 04:10:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704029690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077444370] [2025-02-06 04:10:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:14,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:14,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:14,813 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-02-06 04:10:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:15,649 INFO L93 Difference]: Finished difference Result 618 states and 836 transitions. [2025-02-06 04:10:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:15,649 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-02-06 04:10:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:15,651 INFO L225 Difference]: With dead ends: 618 [2025-02-06 04:10:15,651 INFO L226 Difference]: Without dead ends: 431 [2025-02-06 04:10:15,651 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-02-06 04:10:15,652 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 333 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-02-06 04:10:15,652 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-02-06 04:10:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-06 04:10:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2025-02-06 04:10:15,700 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-02-06 04:10:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 486 transitions. [2025-02-06 04:10:15,701 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 486 transitions. Word has length 156 [2025-02-06 04:10:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:15,701 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 486 transitions. [2025-02-06 04:10:15,701 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-02-06 04:10:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 486 transitions. [2025-02-06 04:10:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:15,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:15,702 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-02-06 04:10:15,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:10:15,702 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:15,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 498441547, now seen corresponding path program 1 times [2025-02-06 04:10:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383274942] [2025-02-06 04:10:15,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:15,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:15,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:15,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:15,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383274942] [2025-02-06 04:10:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383274942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:10:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767764618] [2025-02-06 04:10:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:16,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:16,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:16,438 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-02-06 04:10:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:16,881 INFO L93 Difference]: Finished difference Result 654 states and 891 transitions. [2025-02-06 04:10:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:16,881 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-02-06 04:10:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:16,883 INFO L225 Difference]: With dead ends: 654 [2025-02-06 04:10:16,883 INFO L226 Difference]: Without dead ends: 377 [2025-02-06 04:10:16,883 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-02-06 04:10:16,883 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:16,883 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.4s Time] [2025-02-06 04:10:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-06 04:10:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2025-02-06 04:10:16,923 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-02-06 04:10:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 494 transitions. [2025-02-06 04:10:16,924 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 494 transitions. Word has length 156 [2025-02-06 04:10:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 494 transitions. [2025-02-06 04:10:16,925 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-02-06 04:10:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 494 transitions. [2025-02-06 04:10:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:16,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:16,926 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-02-06 04:10:16,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:10:16,926 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:16,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1144866740, now seen corresponding path program 1 times [2025-02-06 04:10:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:16,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098560983] [2025-02-06 04:10:16,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:16,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:17,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:17,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098560983] [2025-02-06 04:10:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098560983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628541602] [2025-02-06 04:10:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:18,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:18,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:18,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:18,530 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-02-06 04:10:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:19,128 INFO L93 Difference]: Finished difference Result 746 states and 1015 transitions. [2025-02-06 04:10:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:19,128 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-02-06 04:10:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:19,130 INFO L225 Difference]: With dead ends: 746 [2025-02-06 04:10:19,130 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 04:10:19,131 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-02-06 04:10:19,131 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-02-06 04:10:19,134 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-02-06 04:10:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 04:10:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 396. [2025-02-06 04:10:19,190 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-02-06 04:10:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2025-02-06 04:10:19,192 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 156 [2025-02-06 04:10:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:19,192 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2025-02-06 04:10:19,192 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-02-06 04:10:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2025-02-06 04:10:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:19,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:19,193 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-02-06 04:10:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 04:10:19,194 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash -785899171, now seen corresponding path program 1 times [2025-02-06 04:10:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232954290] [2025-02-06 04:10:19,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:19,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:19,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:19,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:19,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:22,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232954290] [2025-02-06 04:10:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232954290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:22,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:10:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182264591] [2025-02-06 04:10:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:10:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:22,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:10:22,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:22,399 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-02-06 04:10:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:23,735 INFO L93 Difference]: Finished difference Result 1039 states and 1413 transitions. [2025-02-06 04:10:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:23,736 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-02-06 04:10:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:23,738 INFO L225 Difference]: With dead ends: 1039 [2025-02-06 04:10:23,738 INFO L226 Difference]: Without dead ends: 804 [2025-02-06 04:10:23,739 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-02-06 04:10:23,739 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-02-06 04:10:23,739 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-02-06 04:10:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-02-06 04:10:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2025-02-06 04:10:23,818 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-02-06 04:10:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1073 transitions. [2025-02-06 04:10:23,820 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1073 transitions. Word has length 156 [2025-02-06 04:10:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:23,821 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1073 transitions. [2025-02-06 04:10:23,821 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-02-06 04:10:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1073 transitions. [2025-02-06 04:10:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:23,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:23,822 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-02-06 04:10:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:10:23,822 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 939581726, now seen corresponding path program 1 times [2025-02-06 04:10:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786329139] [2025-02-06 04:10:23,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:23,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:23,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:23,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:24,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786329139] [2025-02-06 04:10:24,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786329139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:10:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774492395] [2025-02-06 04:10:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:24,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:24,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:24,582 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-02-06 04:10:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:25,009 INFO L93 Difference]: Finished difference Result 1367 states and 1872 transitions. [2025-02-06 04:10:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:10:25,010 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-02-06 04:10:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:25,014 INFO L225 Difference]: With dead ends: 1367 [2025-02-06 04:10:25,015 INFO L226 Difference]: Without dead ends: 754 [2025-02-06 04:10:25,015 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-02-06 04:10:25,016 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-02-06 04:10:25,016 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-02-06 04:10:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-06 04:10:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-02-06 04:10:25,159 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-02-06 04:10:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1021 transitions. [2025-02-06 04:10:25,162 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1021 transitions. Word has length 156 [2025-02-06 04:10:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:25,162 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1021 transitions. [2025-02-06 04:10:25,162 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-02-06 04:10:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1021 transitions. [2025-02-06 04:10:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:25,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:25,163 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-02-06 04:10:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:10:25,164 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:25,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1437218740, now seen corresponding path program 1 times [2025-02-06 04:10:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107920725] [2025-02-06 04:10:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:25,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:25,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:25,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:25,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:10:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107920725] [2025-02-06 04:10:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107920725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:25,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196604560] [2025-02-06 04:10:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:25,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:25,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:25,433 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-02-06 04:10:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:25,835 INFO L93 Difference]: Finished difference Result 1578 states and 2150 transitions. [2025-02-06 04:10:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:25,835 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-02-06 04:10:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:25,838 INFO L225 Difference]: With dead ends: 1578 [2025-02-06 04:10:25,838 INFO L226 Difference]: Without dead ends: 929 [2025-02-06 04:10:25,839 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-02-06 04:10:25,839 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-02-06 04:10:25,840 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-02-06 04:10:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-06 04:10:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 753. [2025-02-06 04:10:25,924 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-02-06 04:10:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1018 transitions. [2025-02-06 04:10:25,926 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1018 transitions. Word has length 156 [2025-02-06 04:10:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:25,926 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1018 transitions. [2025-02-06 04:10:25,926 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-02-06 04:10:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1018 transitions. [2025-02-06 04:10:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:25,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:25,927 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-02-06 04:10:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 04:10:25,927 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1305511662, now seen corresponding path program 1 times [2025-02-06 04:10:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862921135] [2025-02-06 04:10:25,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:26,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:26,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:26,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:10:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862921135] [2025-02-06 04:10:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862921135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317350296] [2025-02-06 04:10:29,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:29,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:10:29,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:30,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 04:10:30,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:32,658 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-02-06 04:10:32,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:32,806 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-02-06 04:10:32,995 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2025-02-06 04:10:32,995 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-02-06 04:10:33,058 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-02-06 04:10:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,144 INFO L349 Elim1Store]: treesize reduction 196, result has 18.7 percent of original size [2025-02-06 04:10:33,145 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-02-06 04:10:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,219 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-02-06 04:10:33,219 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-02-06 04:10:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,283 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-02-06 04:10:33,284 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-02-06 04:10:33,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:33,333 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:33,336 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:33,338 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:33,344 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-02-06 04:10:34,395 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-06 04:10:34,396 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-02-06 04:10:34,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,422 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-02-06 04:10:34,532 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,541 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,543 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-02-06 04:10:34,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,589 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,592 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-02-06 04:10:34,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,649 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,651 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-02-06 04:10:34,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,679 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-02-06 04:10:34,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,722 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-02-06 04:10:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,735 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,741 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:10:34,743 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-02-06 04:10:34,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:34,985 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-02-06 04:10:35,625 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-02-06 04:10:35,625 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-02-06 04:10:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:10:35,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:36,545 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-02-06 04:10:36,831 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-02-06 04:10:37,056 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