./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b3d37dbb1f844bbdab9795055d991e82d88af691e0e65987480a92814525937 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:13:25,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:13:25,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:13:25,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:13:25,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:13:25,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:13:25,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:13:25,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:13:25,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:13:25,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:13:25,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:13:25,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:13:25,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:13:25,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:13:25,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:13:25,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:13:25,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b3d37dbb1f844bbdab9795055d991e82d88af691e0e65987480a92814525937 [2025-03-04 01:13:25,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:13:25,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:13:25,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:13:25,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:13:25,507 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:13:25,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i [2025-03-04 01:13:26,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0a16e8a/0bab865a35c14b0985655fc57aa82609/FLAGaa1b44472 [2025-03-04 01:13:26,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:13:26,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i [2025-03-04 01:13:26,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0a16e8a/0bab865a35c14b0985655fc57aa82609/FLAGaa1b44472 [2025-03-04 01:13:26,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0a16e8a/0bab865a35c14b0985655fc57aa82609 [2025-03-04 01:13:26,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:13:26,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:13:26,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:13:26,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:13:26,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:13:26,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:13:26" (1/1) ... [2025-03-04 01:13:26,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fe072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:26, skipping insertion in model container [2025-03-04 01:13:26,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:13:26" (1/1) ... [2025-03-04 01:13:26,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:13:27,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i[917,930] [2025-03-04 01:13:27,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:13:27,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:13:27,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-12.i[917,930] [2025-03-04 01:13:27,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:13:27,138 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:13:27,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27 WrapperNode [2025-03-04 01:13:27,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:13:27,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:13:27,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:13:27,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:13:27,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,181 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2025-03-04 01:13:27,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:13:27,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:13:27,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:13:27,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:13:27,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,207 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2025-03-04 01:13:27,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:13:27,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:13:27,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:13:27,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:13:27,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (1/1) ... [2025-03-04 01:13:27,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:13:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:27,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:13:27,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:13:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:13:27,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:13:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:13:27,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:13:27,370 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:13:27,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:13:27,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-03-04 01:13:27,755 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 01:13:27,755 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:13:27,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:13:27,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:13:27,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:13:27 BoogieIcfgContainer [2025-03-04 01:13:27,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:13:27,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:13:27,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:13:27,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:13:27,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:13:26" (1/3) ... [2025-03-04 01:13:27,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:13:27, skipping insertion in model container [2025-03-04 01:13:27,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:27" (2/3) ... [2025-03-04 01:13:27,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:13:27, skipping insertion in model container [2025-03-04 01:13:27,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:13:27" (3/3) ... [2025-03-04 01:13:27,775 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-12.i [2025-03-04 01:13:27,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:13:27,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:13:27,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:13:27,839 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;@23c358de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:13:27,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:13:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:13:27,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:27,851 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:27,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash 825168545, now seen corresponding path program 1 times [2025-03-04 01:13:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478320719] [2025-03-04 01:13:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:27,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:13:27,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:13:27,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:27,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:13:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478320719] [2025-03-04 01:13:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478320719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:28,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661137852] [2025-03-04 01:13:28,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:28,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:28,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:28,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:13:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:13:28,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:13:28,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:28,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:28,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:13:28,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:13:28,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:13:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661137852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:13:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288805585] [2025-03-04 01:13:28,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:13:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:28,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:13:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:13:28,348 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:28,371 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-03-04 01:13:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:13:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-03-04 01:13:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:28,378 INFO L225 Difference]: With dead ends: 182 [2025-03-04 01:13:28,378 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:13:28,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:13:28,383 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:28,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:13:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 01:13:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-04 01:13:28,413 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2025-03-04 01:13:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:28,413 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-04 01:13:28,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-04 01:13:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:13:28,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:28,416 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:28,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:13:28,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:13:28,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:28,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1491333777, now seen corresponding path program 1 times [2025-03-04 01:13:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:28,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573778971] [2025-03-04 01:13:28,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:28,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:13:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:13:28,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:28,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573778971] [2025-03-04 01:13:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573778971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984933553] [2025-03-04 01:13:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:28,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:28,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:28,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:28,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:13:29,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:13:29,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:13:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:29,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:13:29,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:29,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:13:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984933553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:29,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:29,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:13:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750683962] [2025-03-04 01:13:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:29,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:13:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:29,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:13:29,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:13:29,190 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:29,223 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-03-04 01:13:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:13:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-03-04 01:13:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:29,226 INFO L225 Difference]: With dead ends: 173 [2025-03-04 01:13:29,227 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:13:29,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:13:29,228 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:29,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:13:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 01:13:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-04 01:13:29,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2025-03-04 01:13:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:29,240 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-04 01:13:29,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-04 01:13:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:29,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:29,243 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:29,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:13:29,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:13:29,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1309974883, now seen corresponding path program 1 times [2025-03-04 01:13:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066255007] [2025-03-04 01:13:29,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:29,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:29,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:29,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066255007] [2025-03-04 01:13:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066255007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558942142] [2025-03-04 01:13:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:29,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:13:29,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:29,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:29,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:29,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:29,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:13:29,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:29,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:13:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558942142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:13:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672139734] [2025-03-04 01:13:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:29,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:29,821 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:29,857 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-03-04 01:13:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-03-04 01:13:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:29,859 INFO L225 Difference]: With dead ends: 176 [2025-03-04 01:13:29,859 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:13:29,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:29,860 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:29,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:13:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 01:13:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-03-04 01:13:29,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2025-03-04 01:13:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:29,872 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-03-04 01:13:29,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-03-04 01:13:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:13:29,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:29,874 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:29,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:13:30,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:30,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:30,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash -79662761, now seen corresponding path program 1 times [2025-03-04 01:13:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035137228] [2025-03-04 01:13:30,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:30,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:13:30,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:13:30,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:30,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035137228] [2025-03-04 01:13:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035137228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:13:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648840670] [2025-03-04 01:13:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:31,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:13:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:31,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:13:31,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:13:31,272 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:13:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:31,584 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2025-03-04 01:13:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:13:31,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 121 [2025-03-04 01:13:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:31,587 INFO L225 Difference]: With dead ends: 133 [2025-03-04 01:13:31,587 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 01:13:31,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:13:31,587 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 184 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:31,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 657 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 01:13:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2025-03-04 01:13:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2025-03-04 01:13:31,603 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 121 [2025-03-04 01:13:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:31,605 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2025-03-04 01:13:31,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:13:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2025-03-04 01:13:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:13:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:31,609 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:13:31,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 939240366, now seen corresponding path program 1 times [2025-03-04 01:13:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290232973] [2025-03-04 01:13:31,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:31,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:13:31,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:13:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-04 01:13:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290232973] [2025-03-04 01:13:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290232973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036292326] [2025-03-04 01:13:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:33,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:13:33,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:13:33,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:13:33,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:33,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:33,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 01:13:33,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:34,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:13:35,145 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 34 treesize of output 25 [2025-03-04 01:13:36,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:13:36,337 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 01:13:36,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-03-04 01:13:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 192 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:36,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036292326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:37,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 44 [2025-03-04 01:13:37,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970079555] [2025-03-04 01:13:37,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 01:13:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 01:13:37,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2185, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 01:13:37,170 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 44 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 01:13:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:38,725 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2025-03-04 01:13:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 01:13:38,726 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 122 [2025-03-04 01:13:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:38,727 INFO L225 Difference]: With dead ends: 193 [2025-03-04 01:13:38,727 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 01:13:38,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=699, Invalid=3993, Unknown=0, NotChecked=0, Total=4692 [2025-03-04 01:13:38,730 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 534 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:38,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2347 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:13:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 01:13:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 132. [2025-03-04 01:13:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2025-03-04 01:13:38,740 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 122 [2025-03-04 01:13:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:38,741 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2025-03-04 01:13:38,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 01:13:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2025-03-04 01:13:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:13:38,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:38,742 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:38,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:13:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:38,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1530609216, now seen corresponding path program 1 times [2025-03-04 01:13:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618883413] [2025-03-04 01:13:38,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:38,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:13:39,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:13:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-04 01:13:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618883413] [2025-03-04 01:13:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618883413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002457362] [2025-03-04 01:13:40,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:40,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:40,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:40,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:13:40,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:13:40,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:13:40,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:40,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:40,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 01:13:40,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:40,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:41,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:13:41,839 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 34 treesize of output 25 [2025-03-04 01:13:42,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:13:42,851 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 01:13:42,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-03-04 01:13:43,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:13:43,135 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:13:43,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2025-03-04 01:13:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 192 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:43,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002457362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:43,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2025-03-04 01:13:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629202289] [2025-03-04 01:13:43,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 01:13:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 01:13:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2384, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 01:13:43,665 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 46 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 01:13:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:45,138 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2025-03-04 01:13:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 01:13:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 123 [2025-03-04 01:13:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:45,140 INFO L225 Difference]: With dead ends: 203 [2025-03-04 01:13:45,141 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:13:45,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=755, Invalid=4501, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 01:13:45,142 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1099 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:45,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1692 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:13:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:13:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 134. [2025-03-04 01:13:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.25) internal successors, (140), 112 states have internal predecessors, (140), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-03-04 01:13:45,158 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 123 [2025-03-04 01:13:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-03-04 01:13:45,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 01:13:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-03-04 01:13:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:13:45,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:45,161 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:45,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:45,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:45,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300440, now seen corresponding path program 1 times [2025-03-04 01:13:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983004194] [2025-03-04 01:13:45,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:45,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:13:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:13:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983004194] [2025-03-04 01:13:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983004194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215642192] [2025-03-04 01:13:45,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:45,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:45,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:13:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:13:45,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:13:45,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:45,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:45,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:13:45,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:45,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-04 01:13:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:13:46,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:46,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2025-03-04 01:13:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:46,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215642192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:13:46,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:13:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-04 01:13:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034050232] [2025-03-04 01:13:46,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:13:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:46,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:13:46,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:13:46,269 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 19 states, 16 states have (on average 5.625) internal successors, (90), 18 states have internal predecessors, (90), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2025-03-04 01:13:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:46,567 INFO L93 Difference]: Finished difference Result 299 states and 374 transitions. [2025-03-04 01:13:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:13:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.625) internal successors, (90), 18 states have internal predecessors, (90), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) Word has length 124 [2025-03-04 01:13:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:46,569 INFO L225 Difference]: With dead ends: 299 [2025-03-04 01:13:46,569 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 01:13:46,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:13:46,570 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 284 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:46,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 539 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 01:13:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 138. [2025-03-04 01:13:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 115 states have internal predecessors, (142), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2025-03-04 01:13:46,583 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 124 [2025-03-04 01:13:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:46,583 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2025-03-04 01:13:46,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.625) internal successors, (90), 18 states have internal predecessors, (90), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2025-03-04 01:13:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2025-03-04 01:13:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:13:46,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:46,585 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:46,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:46,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:46,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1805566955, now seen corresponding path program 1 times [2025-03-04 01:13:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120690658] [2025-03-04 01:13:46,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:13:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:13:46,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:46,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120690658] [2025-03-04 01:13:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120690658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085972647] [2025-03-04 01:13:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:46,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:46,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:46,894 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:46,960 INFO L93 Difference]: Finished difference Result 355 states and 439 transitions. [2025-03-04 01:13:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:46,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-04 01:13:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:46,962 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:13:46,963 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 01:13:46,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:46,964 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:46,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 506 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 01:13:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 159. [2025-03-04 01:13:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2025-03-04 01:13:46,980 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 124 [2025-03-04 01:13:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2025-03-04 01:13:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2025-03-04 01:13:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:13:46,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:46,982 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:46,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:13:46,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -821114822, now seen corresponding path program 1 times [2025-03-04 01:13:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776182677] [2025-03-04 01:13:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:46,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:13:47,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:13:47,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:47,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776182677] [2025-03-04 01:13:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776182677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301467900] [2025-03-04 01:13:47,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:47,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:47,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:13:47,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:13:47,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:13:47,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:47,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:47,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:13:47,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:48,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:13:48,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:13:48,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-04 01:13:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:13:48,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301467900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:48,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-04 01:13:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450982364] [2025-03-04 01:13:48,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:48,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:13:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:48,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:13:48,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:13:48,529 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-04 01:13:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:48,848 INFO L93 Difference]: Finished difference Result 319 states and 397 transitions. [2025-03-04 01:13:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:13:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) Word has length 125 [2025-03-04 01:13:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:48,850 INFO L225 Difference]: With dead ends: 319 [2025-03-04 01:13:48,850 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 01:13:48,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:13:48,851 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 330 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:48,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 441 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 01:13:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2025-03-04 01:13:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:13:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2025-03-04 01:13:48,862 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 125 [2025-03-04 01:13:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:48,863 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2025-03-04 01:13:48,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.466666666666667) internal successors, (97), 16 states have internal predecessors, (97), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-04 01:13:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2025-03-04 01:13:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:13:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:48,864 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:48,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:49,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:49,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2035570058, now seen corresponding path program 1 times [2025-03-04 01:13:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711529310] [2025-03-04 01:13:49,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:49,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:13:49,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:13:49,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:49,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:13:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841526675] [2025-03-04 01:13:49,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:49,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:49,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:13:49,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:13:49,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:13:49,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:49,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:49,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:13:49,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:49,600 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 23 treesize of output 11 [2025-03-04 01:13:49,664 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 23 treesize of output 11 [2025-03-04 01:13:49,727 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 23 treesize of output 11 [2025-03-04 01:13:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 01:13:49,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:49,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711529310] [2025-03-04 01:13:49,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:13:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841526675] [2025-03-04 01:13:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841526675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:49,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 01:13:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634559915] [2025-03-04 01:13:49,843 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:49,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:13:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:49,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:13:49,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:13:49,844 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:50,025 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2025-03-04 01:13:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:50,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-03-04 01:13:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:50,028 INFO L225 Difference]: With dead ends: 417 [2025-03-04 01:13:50,028 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 01:13:50,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:13:50,029 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 56 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:50,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 324 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 01:13:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2025-03-04 01:13:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 204 states have internal predecessors, (239), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:13:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2025-03-04 01:13:50,051 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 126 [2025-03-04 01:13:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:50,051 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2025-03-04 01:13:50,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2025-03-04 01:13:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:13:50,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:50,053 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:50,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:50,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:13:50,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1208991588, now seen corresponding path program 1 times [2025-03-04 01:13:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502573825] [2025-03-04 01:13:50,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:50,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:13:50,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:13:50,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:50,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:13:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718091861] [2025-03-04 01:13:50,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:50,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:50,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:50,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:13:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:13:50,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:13:50,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:50,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:50,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 01:13:50,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:51,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:51,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:13:51,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:13:51,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 49 [2025-03-04 01:13:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 118 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-04 01:13:51,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502573825] [2025-03-04 01:13:51,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:13:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718091861] [2025-03-04 01:13:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718091861] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-04 01:13:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563284002] [2025-03-04 01:13:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:13:51,976 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:52,277 INFO L93 Difference]: Finished difference Result 641 states and 765 transitions. [2025-03-04 01:13:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-03-04 01:13:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:52,280 INFO L225 Difference]: With dead ends: 641 [2025-03-04 01:13:52,281 INFO L226 Difference]: Without dead ends: 395 [2025-03-04 01:13:52,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:13:52,281 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 58 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:52,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 378 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-04 01:13:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2025-03-04 01:13:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 314 states have (on average 1.1337579617834395) internal successors, (356), 316 states have internal predecessors, (356), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:13:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 460 transitions. [2025-03-04 01:13:52,321 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 460 transitions. Word has length 127 [2025-03-04 01:13:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:52,322 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 460 transitions. [2025-03-04 01:13:52,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 460 transitions. [2025-03-04 01:13:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:13:52,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:52,323 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:52,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 01:13:52,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:52,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:52,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1612062131, now seen corresponding path program 1 times [2025-03-04 01:13:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175665081] [2025-03-04 01:13:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:52,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:13:52,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:13:52,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:52,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:13:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782325780] [2025-03-04 01:13:52,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:52,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:52,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:13:52,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:13:52,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:13:52,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:52,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:52,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 01:13:52,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:53,055 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 23 treesize of output 11 [2025-03-04 01:13:53,119 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 23 treesize of output 11 [2025-03-04 01:13:53,181 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 23 treesize of output 11 [2025-03-04 01:13:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 01:13:53,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175665081] [2025-03-04 01:13:53,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:13:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782325780] [2025-03-04 01:13:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782325780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:53,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 01:13:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61803972] [2025-03-04 01:13:53,359 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:53,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:53,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:53,360 INFO L87 Difference]: Start difference. First operand 391 states and 460 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:53,525 INFO L93 Difference]: Finished difference Result 777 states and 917 transitions. [2025-03-04 01:13:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:13:53,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-03-04 01:13:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:53,529 INFO L225 Difference]: With dead ends: 777 [2025-03-04 01:13:53,529 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 01:13:53,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:13:53,531 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 42 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:53,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 363 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 01:13:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 382. [2025-03-04 01:13:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 305 states have (on average 1.1278688524590164) internal successors, (344), 307 states have internal predecessors, (344), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:13:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 448 transitions. [2025-03-04 01:13:53,576 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 448 transitions. Word has length 128 [2025-03-04 01:13:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 448 transitions. [2025-03-04 01:13:53,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:13:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 448 transitions. [2025-03-04 01:13:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:13:53,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:53,583 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:53,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 01:13:53,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:53,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 893535468, now seen corresponding path program 1 times [2025-03-04 01:13:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951399322] [2025-03-04 01:13:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:53,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:13:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:13:53,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:53,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951399322] [2025-03-04 01:13:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951399322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:13:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219796131] [2025-03-04 01:13:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:13:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:54,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:13:54,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:13:54,596 INFO L87 Difference]: Start difference. First operand 382 states and 448 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:13:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:55,718 INFO L93 Difference]: Finished difference Result 824 states and 977 transitions. [2025-03-04 01:13:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:13:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:13:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:55,722 INFO L225 Difference]: With dead ends: 824 [2025-03-04 01:13:55,722 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 01:13:55,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:13:55,725 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 289 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:55,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1513 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:13:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 01:13:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 458. [2025-03-04 01:13:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 381 states have (on average 1.1653543307086613) internal successors, (444), 383 states have internal predecessors, (444), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:13:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 548 transitions. [2025-03-04 01:13:55,771 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 548 transitions. Word has length 129 [2025-03-04 01:13:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 548 transitions. [2025-03-04 01:13:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:13:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 548 transitions. [2025-03-04 01:13:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:13:55,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:55,773 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:13:55,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 697021963, now seen corresponding path program 1 times [2025-03-04 01:13:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514138031] [2025-03-04 01:13:55,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:55,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:13:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:13:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514138031] [2025-03-04 01:13:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514138031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:56,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:56,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:13:56,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323942407] [2025-03-04 01:13:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:56,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:13:56,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:56,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:13:56,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:56,009 INFO L87 Difference]: Start difference. First operand 458 states and 548 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:56,152 INFO L93 Difference]: Finished difference Result 783 states and 958 transitions. [2025-03-04 01:13:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:13:56,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:13:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:56,155 INFO L225 Difference]: With dead ends: 783 [2025-03-04 01:13:56,155 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 01:13:56,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:56,156 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:56,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 01:13:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-04 01:13:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 393 states have (on average 1.1755725190839694) internal successors, (462), 395 states have internal predecessors, (462), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:13:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 566 transitions. [2025-03-04 01:13:56,220 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 566 transitions. Word has length 129 [2025-03-04 01:13:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:56,220 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 566 transitions. [2025-03-04 01:13:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:13:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 566 transitions. [2025-03-04 01:13:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:13:56,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:56,221 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:13:56,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1425239952, now seen corresponding path program 1 times [2025-03-04 01:13:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242980] [2025-03-04 01:13:56,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:13:56,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:13:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:56,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:57,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242980] [2025-03-04 01:13:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:57,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:13:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684562657] [2025-03-04 01:13:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:13:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:57,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:13:57,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:13:57,411 INFO L87 Difference]: Start difference. First operand 470 states and 566 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:13:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:58,454 INFO L93 Difference]: Finished difference Result 1121 states and 1367 transitions. [2025-03-04 01:13:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:13:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:13:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:58,459 INFO L225 Difference]: With dead ends: 1121 [2025-03-04 01:13:58,459 INFO L226 Difference]: Without dead ends: 796 [2025-03-04 01:13:58,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:13:58,462 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 251 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:58,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 645 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:13:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-04 01:13:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 550. [2025-03-04 01:13:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 473 states have (on average 1.1966173361522199) internal successors, (566), 475 states have internal predecessors, (566), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:13:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 670 transitions. [2025-03-04 01:13:58,554 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 670 transitions. Word has length 129 [2025-03-04 01:13:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:58,555 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 670 transitions. [2025-03-04 01:13:58,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:13:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 670 transitions. [2025-03-04 01:13:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:13:58,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:58,556 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:58,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:13:58,556 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:58,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 826104682, now seen corresponding path program 1 times [2025-03-04 01:13:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239037725] [2025-03-04 01:13:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:58,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:13:58,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:13:58,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:13:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239037725] [2025-03-04 01:13:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239037725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:59,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:59,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:13:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96474486] [2025-03-04 01:13:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:59,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:13:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:59,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:13:59,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:13:59,535 INFO L87 Difference]: Start difference. First operand 550 states and 670 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:00,326 INFO L93 Difference]: Finished difference Result 1198 states and 1475 transitions. [2025-03-04 01:14:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:14:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:00,329 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 01:14:00,329 INFO L226 Difference]: Without dead ends: 793 [2025-03-04 01:14:00,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:00,330 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 189 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:00,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 884 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-04 01:14:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 582. [2025-03-04 01:14:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 505 states have (on average 1.2) internal successors, (606), 507 states have internal predecessors, (606), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 710 transitions. [2025-03-04 01:14:00,387 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 710 transitions. Word has length 129 [2025-03-04 01:14:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:00,387 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 710 transitions. [2025-03-04 01:14:00,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 710 transitions. [2025-03-04 01:14:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:00,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:00,388 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:00,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:14:00,388 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:00,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1296157233, now seen corresponding path program 1 times [2025-03-04 01:14:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671945756] [2025-03-04 01:14:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:00,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:00,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:00,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:00,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:01,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:01,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671945756] [2025-03-04 01:14:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671945756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:14:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802878611] [2025-03-04 01:14:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:01,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:14:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:01,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:14:01,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:01,474 INFO L87 Difference]: Start difference. First operand 582 states and 710 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:02,384 INFO L93 Difference]: Finished difference Result 1290 states and 1570 transitions. [2025-03-04 01:14:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:14:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:14:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:02,387 INFO L225 Difference]: With dead ends: 1290 [2025-03-04 01:14:02,387 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 01:14:02,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:14:02,388 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 450 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:02,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 848 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 01:14:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 591. [2025-03-04 01:14:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 514 states have (on average 1.2081712062256809) internal successors, (621), 516 states have internal predecessors, (621), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 725 transitions. [2025-03-04 01:14:02,447 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 725 transitions. Word has length 129 [2025-03-04 01:14:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:02,448 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 725 transitions. [2025-03-04 01:14:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 725 transitions. [2025-03-04 01:14:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:02,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:02,449 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:14:02,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1492670738, now seen corresponding path program 1 times [2025-03-04 01:14:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130691646] [2025-03-04 01:14:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:02,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:02,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130691646] [2025-03-04 01:14:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130691646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:03,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:14:03,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991899811] [2025-03-04 01:14:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:03,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:14:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:03,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:14:03,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:03,283 INFO L87 Difference]: Start difference. First operand 591 states and 725 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 01:14:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:04,014 INFO L93 Difference]: Finished difference Result 1144 states and 1410 transitions. [2025-03-04 01:14:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:04,015 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2025-03-04 01:14:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:04,017 INFO L225 Difference]: With dead ends: 1144 [2025-03-04 01:14:04,017 INFO L226 Difference]: Without dead ends: 698 [2025-03-04 01:14:04,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:14:04,018 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 315 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:04,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 828 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-04 01:14:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 588. [2025-03-04 01:14:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 511 states have (on average 1.203522504892368) internal successors, (615), 513 states have internal predecessors, (615), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 719 transitions. [2025-03-04 01:14:04,103 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 719 transitions. Word has length 129 [2025-03-04 01:14:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 719 transitions. [2025-03-04 01:14:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 01:14:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 719 transitions. [2025-03-04 01:14:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:04,104 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:14:04,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash 826528715, now seen corresponding path program 1 times [2025-03-04 01:14:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59733277] [2025-03-04 01:14:04,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:04,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:04,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:04,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:04,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59733277] [2025-03-04 01:14:04,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59733277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:04,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:04,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598018394] [2025-03-04 01:14:04,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:04,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:04,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:04,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:14:04,247 INFO L87 Difference]: Start difference. First operand 588 states and 719 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:04,370 INFO L93 Difference]: Finished difference Result 995 states and 1231 transitions. [2025-03-04 01:14:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:14:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:04,373 INFO L225 Difference]: With dead ends: 995 [2025-03-04 01:14:04,373 INFO L226 Difference]: Without dead ends: 552 [2025-03-04 01:14:04,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:04,374 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 7 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:04,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 396 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-04 01:14:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-04 01:14:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 475 states have (on average 1.1978947368421053) internal successors, (569), 477 states have internal predecessors, (569), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 673 transitions. [2025-03-04 01:14:04,440 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 673 transitions. Word has length 129 [2025-03-04 01:14:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 673 transitions. [2025-03-04 01:14:04,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 673 transitions. [2025-03-04 01:14:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:04,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:04,442 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:14:04,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:04,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1590696304, now seen corresponding path program 1 times [2025-03-04 01:14:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433194452] [2025-03-04 01:14:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:04,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:04,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:04,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:04,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433194452] [2025-03-04 01:14:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433194452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:14:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737708494] [2025-03-04 01:14:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:14:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:14:04,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:04,976 INFO L87 Difference]: Start difference. First operand 552 states and 673 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:05,565 INFO L93 Difference]: Finished difference Result 1105 states and 1350 transitions. [2025-03-04 01:14:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:05,568 INFO L225 Difference]: With dead ends: 1105 [2025-03-04 01:14:05,569 INFO L226 Difference]: Without dead ends: 698 [2025-03-04 01:14:05,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:14:05,570 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 237 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:05,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 767 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-04 01:14:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 553. [2025-03-04 01:14:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 476 states have (on average 1.1932773109243697) internal successors, (568), 478 states have internal predecessors, (568), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 672 transitions. [2025-03-04 01:14:05,640 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 672 transitions. Word has length 129 [2025-03-04 01:14:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 672 transitions. [2025-03-04 01:14:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 672 transitions. [2025-03-04 01:14:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:05,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:05,641 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:05,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:14:05,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:05,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash -728079116, now seen corresponding path program 1 times [2025-03-04 01:14:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802400342] [2025-03-04 01:14:05,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:05,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:05,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:05,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802400342] [2025-03-04 01:14:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802400342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 01:14:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84607762] [2025-03-04 01:14:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:14:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:14:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:14:06,894 INFO L87 Difference]: Start difference. First operand 553 states and 672 transitions. Second operand has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:08,670 INFO L93 Difference]: Finished difference Result 1131 states and 1382 transitions. [2025-03-04 01:14:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:14:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:14:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:08,673 INFO L225 Difference]: With dead ends: 1131 [2025-03-04 01:14:08,673 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 01:14:08,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:14:08,675 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:08,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1877 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:14:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 01:14:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 595. [2025-03-04 01:14:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 518 states have (on average 1.2007722007722008) internal successors, (622), 520 states have internal predecessors, (622), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 726 transitions. [2025-03-04 01:14:08,738 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 726 transitions. Word has length 129 [2025-03-04 01:14:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:08,738 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 726 transitions. [2025-03-04 01:14:08,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 726 transitions. [2025-03-04 01:14:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:08,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:08,739 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:08,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:14:08,739 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -924592621, now seen corresponding path program 1 times [2025-03-04 01:14:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130693182] [2025-03-04 01:14:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:08,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130693182] [2025-03-04 01:14:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130693182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:08,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:14:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306554661] [2025-03-04 01:14:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:08,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:08,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:08,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:08,932 INFO L87 Difference]: Start difference. First operand 595 states and 726 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:09,186 INFO L93 Difference]: Finished difference Result 1232 states and 1506 transitions. [2025-03-04 01:14:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:14:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:09,191 INFO L225 Difference]: With dead ends: 1232 [2025-03-04 01:14:09,191 INFO L226 Difference]: Without dead ends: 782 [2025-03-04 01:14:09,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:09,194 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 62 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:09,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 646 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-04 01:14:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 596. [2025-03-04 01:14:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 519 states have (on average 1.1946050096339114) internal successors, (620), 521 states have internal predecessors, (620), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 724 transitions. [2025-03-04 01:14:09,261 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 724 transitions. Word has length 129 [2025-03-04 01:14:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 724 transitions. [2025-03-04 01:14:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 724 transitions. [2025-03-04 01:14:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:09,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:09,263 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:09,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:14:09,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:09,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1719779023, now seen corresponding path program 1 times [2025-03-04 01:14:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:09,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405278435] [2025-03-04 01:14:09,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:09,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:09,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:09,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405278435] [2025-03-04 01:14:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405278435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207571277] [2025-03-04 01:14:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:09,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:09,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:09,672 INFO L87 Difference]: Start difference. First operand 596 states and 724 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:10,110 INFO L93 Difference]: Finished difference Result 1130 states and 1394 transitions. [2025-03-04 01:14:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:14:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:10,114 INFO L225 Difference]: With dead ends: 1130 [2025-03-04 01:14:10,114 INFO L226 Difference]: Without dead ends: 670 [2025-03-04 01:14:10,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:10,115 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 179 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:10,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 449 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-04 01:14:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 594. [2025-03-04 01:14:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 517 states have (on average 1.1702127659574468) internal successors, (605), 519 states have internal predecessors, (605), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 709 transitions. [2025-03-04 01:14:10,181 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 709 transitions. Word has length 129 [2025-03-04 01:14:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 709 transitions. [2025-03-04 01:14:10,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 709 transitions. [2025-03-04 01:14:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:10,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:10,183 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:10,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:14:10,184 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -795509902, now seen corresponding path program 1 times [2025-03-04 01:14:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687099540] [2025-03-04 01:14:10,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:10,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:10,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:10,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:10,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687099540] [2025-03-04 01:14:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687099540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695879655] [2025-03-04 01:14:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:10,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:10,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:10,868 INFO L87 Difference]: Start difference. First operand 594 states and 709 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:11,362 INFO L93 Difference]: Finished difference Result 1141 states and 1366 transitions. [2025-03-04 01:14:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:14:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:14:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:11,364 INFO L225 Difference]: With dead ends: 1141 [2025-03-04 01:14:11,365 INFO L226 Difference]: Without dead ends: 692 [2025-03-04 01:14:11,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:14:11,366 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 240 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:11,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 627 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-04 01:14:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 588. [2025-03-04 01:14:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 511 states have (on average 1.1604696673189825) internal successors, (593), 513 states have internal predecessors, (593), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 697 transitions. [2025-03-04 01:14:11,430 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 697 transitions. Word has length 129 [2025-03-04 01:14:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:11,430 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 697 transitions. [2025-03-04 01:14:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 697 transitions. [2025-03-04 01:14:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:11,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:11,432 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:11,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:14:11,432 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -795085869, now seen corresponding path program 1 times [2025-03-04 01:14:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:11,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702630836] [2025-03-04 01:14:11,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:11,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:11,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702630836] [2025-03-04 01:14:11,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702630836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:11,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166868442] [2025-03-04 01:14:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:11,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:11,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:11,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:11,698 INFO L87 Difference]: Start difference. First operand 588 states and 697 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:11,912 INFO L93 Difference]: Finished difference Result 995 states and 1190 transitions. [2025-03-04 01:14:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:11,915 INFO L225 Difference]: With dead ends: 995 [2025-03-04 01:14:11,915 INFO L226 Difference]: Without dead ends: 552 [2025-03-04 01:14:11,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:14:11,916 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:11,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 349 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-04 01:14:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-04 01:14:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 475 states have (on average 1.1578947368421053) internal successors, (550), 477 states have internal predecessors, (550), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 654 transitions. [2025-03-04 01:14:11,983 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 654 transitions. Word has length 129 [2025-03-04 01:14:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:11,984 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 654 transitions. [2025-03-04 01:14:11,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 654 transitions. [2025-03-04 01:14:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:11,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:11,985 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:14:11,985 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:11,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1394220145, now seen corresponding path program 1 times [2025-03-04 01:14:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655041744] [2025-03-04 01:14:11,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:11,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:12,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:12,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:12,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655041744] [2025-03-04 01:14:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655041744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:12,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796771197] [2025-03-04 01:14:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:12,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:12,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:14:12,098 INFO L87 Difference]: Start difference. First operand 552 states and 654 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:12,287 INFO L93 Difference]: Finished difference Result 963 states and 1138 transitions. [2025-03-04 01:14:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:12,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:14:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:12,290 INFO L225 Difference]: With dead ends: 963 [2025-03-04 01:14:12,290 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 01:14:12,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:12,291 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 43 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:12,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 384 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 01:14:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 510. [2025-03-04 01:14:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 433 states have (on average 1.1339491916859123) internal successors, (491), 435 states have internal predecessors, (491), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 595 transitions. [2025-03-04 01:14:12,360 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 595 transitions. Word has length 129 [2025-03-04 01:14:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 595 transitions. [2025-03-04 01:14:12,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 595 transitions. [2025-03-04 01:14:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:12,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:12,364 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:14:12,364 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:12,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 857548522, now seen corresponding path program 1 times [2025-03-04 01:14:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085072035] [2025-03-04 01:14:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:12,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:12,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:12,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085072035] [2025-03-04 01:14:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085072035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:13,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408826525] [2025-03-04 01:14:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:13,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:13,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:13,015 INFO L87 Difference]: Start difference. First operand 510 states and 595 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:13,569 INFO L93 Difference]: Finished difference Result 1030 states and 1196 transitions. [2025-03-04 01:14:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:14:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-03-04 01:14:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:13,572 INFO L225 Difference]: With dead ends: 1030 [2025-03-04 01:14:13,573 INFO L226 Difference]: Without dead ends: 665 [2025-03-04 01:14:13,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:14:13,574 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 227 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 691 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-04 01:14:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 489. [2025-03-04 01:14:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 412 states have (on average 1.1213592233009708) internal successors, (462), 414 states have internal predecessors, (462), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 566 transitions. [2025-03-04 01:14:13,641 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 566 transitions. Word has length 129 [2025-03-04 01:14:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 566 transitions. [2025-03-04 01:14:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 566 transitions. [2025-03-04 01:14:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:13,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:13,643 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:14:13,643 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 790117736, now seen corresponding path program 1 times [2025-03-04 01:14:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151253046] [2025-03-04 01:14:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:13,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:13,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:13,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151253046] [2025-03-04 01:14:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151253046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:14:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156989211] [2025-03-04 01:14:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:14:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:14:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:14,393 INFO L87 Difference]: Start difference. First operand 489 states and 566 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:15,419 INFO L93 Difference]: Finished difference Result 990 states and 1154 transitions. [2025-03-04 01:14:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:14:15,419 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:15,422 INFO L225 Difference]: With dead ends: 990 [2025-03-04 01:14:15,422 INFO L226 Difference]: Without dead ends: 646 [2025-03-04 01:14:15,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:14:15,423 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 227 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:15,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1647 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:14:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-04 01:14:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 527. [2025-03-04 01:14:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 450 states have (on average 1.1311111111111112) internal successors, (509), 452 states have internal predecessors, (509), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 613 transitions. [2025-03-04 01:14:15,497 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 613 transitions. Word has length 129 [2025-03-04 01:14:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:15,497 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 613 transitions. [2025-03-04 01:14:15,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 613 transitions. [2025-03-04 01:14:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:15,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:15,498 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:15,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:14:15,498 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1332144179, now seen corresponding path program 1 times [2025-03-04 01:14:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707783479] [2025-03-04 01:14:15,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:15,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:15,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:15,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:15,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:15,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:15,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707783479] [2025-03-04 01:14:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707783479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:14:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117721069] [2025-03-04 01:14:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:15,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:15,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:15,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:15,675 INFO L87 Difference]: Start difference. First operand 527 states and 613 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:15,936 INFO L93 Difference]: Finished difference Result 1038 states and 1206 transitions. [2025-03-04 01:14:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:14:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:15,939 INFO L225 Difference]: With dead ends: 1038 [2025-03-04 01:14:15,939 INFO L226 Difference]: Without dead ends: 656 [2025-03-04 01:14:15,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:15,939 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:15,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-04 01:14:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 527. [2025-03-04 01:14:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 450 states have (on average 1.1244444444444444) internal successors, (506), 452 states have internal predecessors, (506), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 610 transitions. [2025-03-04 01:14:16,008 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 610 transitions. Word has length 129 [2025-03-04 01:14:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:16,009 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 610 transitions. [2025-03-04 01:14:16,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 610 transitions. [2025-03-04 01:14:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:16,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:16,010 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:16,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:14:16,010 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:16,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1528657684, now seen corresponding path program 1 times [2025-03-04 01:14:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908149958] [2025-03-04 01:14:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:16,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:16,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:16,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:16,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908149958] [2025-03-04 01:14:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908149958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:14:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164265786] [2025-03-04 01:14:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:14:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:16,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:14:16,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:16,825 INFO L87 Difference]: Start difference. First operand 527 states and 610 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:17,556 INFO L93 Difference]: Finished difference Result 992 states and 1150 transitions. [2025-03-04 01:14:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:17,559 INFO L225 Difference]: With dead ends: 992 [2025-03-04 01:14:17,559 INFO L226 Difference]: Without dead ends: 610 [2025-03-04 01:14:17,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:14:17,560 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 261 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:17,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 821 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-04 01:14:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 527. [2025-03-04 01:14:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 450 states have (on average 1.1177777777777778) internal successors, (503), 452 states have internal predecessors, (503), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 607 transitions. [2025-03-04 01:14:17,631 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 607 transitions. Word has length 129 [2025-03-04 01:14:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 607 transitions. [2025-03-04 01:14:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 607 transitions. [2025-03-04 01:14:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:17,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:17,632 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:14:17,632 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1554285325, now seen corresponding path program 1 times [2025-03-04 01:14:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95144595] [2025-03-04 01:14:17,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:17,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:17,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:17,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:17,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95144595] [2025-03-04 01:14:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95144595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489004249] [2025-03-04 01:14:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:17,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:17,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:17,955 INFO L87 Difference]: Start difference. First operand 527 states and 607 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:18,218 INFO L93 Difference]: Finished difference Result 955 states and 1102 transitions. [2025-03-04 01:14:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:18,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:18,220 INFO L225 Difference]: With dead ends: 955 [2025-03-04 01:14:18,220 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 01:14:18,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:14:18,221 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 112 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:18,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 359 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 01:14:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 527. [2025-03-04 01:14:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 450 states have (on average 1.1155555555555556) internal successors, (502), 452 states have internal predecessors, (502), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 606 transitions. [2025-03-04 01:14:18,292 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 606 transitions. Word has length 129 [2025-03-04 01:14:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 606 transitions. [2025-03-04 01:14:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 606 transitions. [2025-03-04 01:14:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:18,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:18,293 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:18,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:14:18,293 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1487278572, now seen corresponding path program 1 times [2025-03-04 01:14:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032451021] [2025-03-04 01:14:18,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:18,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032451021] [2025-03-04 01:14:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032451021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:18,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:14:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328919448] [2025-03-04 01:14:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:14:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:18,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:14:18,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:18,835 INFO L87 Difference]: Start difference. First operand 527 states and 606 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:19,357 INFO L93 Difference]: Finished difference Result 1026 states and 1180 transitions. [2025-03-04 01:14:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:19,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:19,360 INFO L225 Difference]: With dead ends: 1026 [2025-03-04 01:14:19,360 INFO L226 Difference]: Without dead ends: 644 [2025-03-04 01:14:19,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:14:19,361 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 153 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:19,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 739 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-04 01:14:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 521. [2025-03-04 01:14:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 444 states have (on average 1.1103603603603605) internal successors, (493), 446 states have internal predecessors, (493), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 597 transitions. [2025-03-04 01:14:19,435 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 597 transitions. Word has length 129 [2025-03-04 01:14:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:19,435 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 597 transitions. [2025-03-04 01:14:19,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 597 transitions. [2025-03-04 01:14:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:14:19,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:19,436 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:19,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:14:19,436 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:19,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash -831496848, now seen corresponding path program 1 times [2025-03-04 01:14:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670398953] [2025-03-04 01:14:19,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:19,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:14:19,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:14:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670398953] [2025-03-04 01:14:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670398953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:14:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643863994] [2025-03-04 01:14:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:20,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:14:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:20,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:14:20,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:20,193 INFO L87 Difference]: Start difference. First operand 521 states and 597 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:21,237 INFO L93 Difference]: Finished difference Result 983 states and 1127 transitions. [2025-03-04 01:14:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:14:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-04 01:14:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:21,240 INFO L225 Difference]: With dead ends: 983 [2025-03-04 01:14:21,240 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 01:14:21,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:14:21,242 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 142 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1648 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:14:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 01:14:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 506. [2025-03-04 01:14:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 429 states have (on average 1.1072261072261071) internal successors, (475), 431 states have internal predecessors, (475), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 579 transitions. [2025-03-04 01:14:21,328 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 579 transitions. Word has length 129 [2025-03-04 01:14:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:21,328 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 579 transitions. [2025-03-04 01:14:21,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:14:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 579 transitions. [2025-03-04 01:14:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:14:21,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:21,329 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:21,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:14:21,329 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1746639435, now seen corresponding path program 1 times [2025-03-04 01:14:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251184567] [2025-03-04 01:14:21,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:14:21,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:14:21,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:21,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251184567] [2025-03-04 01:14:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251184567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:21,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246405701] [2025-03-04 01:14:21,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:21,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:21,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:14:21,391 INFO L87 Difference]: Start difference. First operand 506 states and 579 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:21,534 INFO L93 Difference]: Finished difference Result 946 states and 1076 transitions. [2025-03-04 01:14:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-04 01:14:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:21,537 INFO L225 Difference]: With dead ends: 946 [2025-03-04 01:14:21,537 INFO L226 Difference]: Without dead ends: 585 [2025-03-04 01:14:21,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:21,538 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:21,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-04 01:14:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 506. [2025-03-04 01:14:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 429 states have (on average 1.0792540792540792) internal successors, (463), 431 states have internal predecessors, (463), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 567 transitions. [2025-03-04 01:14:21,613 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 567 transitions. Word has length 131 [2025-03-04 01:14:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:21,613 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 567 transitions. [2025-03-04 01:14:21,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 567 transitions. [2025-03-04 01:14:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:14:21,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:21,614 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:14:21,614 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 621306219, now seen corresponding path program 1 times [2025-03-04 01:14:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640418065] [2025-03-04 01:14:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:21,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:21,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:21,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:21,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-04 01:14:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640418065] [2025-03-04 01:14:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640418065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833172644] [2025-03-04 01:14:22,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:22,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:22,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:22,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 01:14:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:22,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 01:14:22,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:22,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 01:14:23,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:14:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 40 proven. 115 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:14:23,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833172644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:23,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:14:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-03-04 01:14:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710080008] [2025-03-04 01:14:23,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:14:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 01:14:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:23,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 01:14:23,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:14:23,955 INFO L87 Difference]: Start difference. First operand 506 states and 567 transitions. Second operand has 24 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 01:14:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:24,781 INFO L93 Difference]: Finished difference Result 859 states and 957 transitions. [2025-03-04 01:14:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:14:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 8 states have call successors, (32) Word has length 136 [2025-03-04 01:14:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:24,785 INFO L225 Difference]: With dead ends: 859 [2025-03-04 01:14:24,785 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 01:14:24,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1702, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 01:14:24,787 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 376 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:24,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 517 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 01:14:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 482. [2025-03-04 01:14:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 401 states have (on average 1.0748129675810474) internal successors, (431), 403 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 28 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 535 transitions. [2025-03-04 01:14:24,879 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 535 transitions. Word has length 136 [2025-03-04 01:14:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:24,879 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 535 transitions. [2025-03-04 01:14:24,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 01:14:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 535 transitions. [2025-03-04 01:14:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:14:24,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:24,880 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:24,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 01:14:25,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 01:14:25,081 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -930829589, now seen corresponding path program 1 times [2025-03-04 01:14:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042498774] [2025-03-04 01:14:25,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:25,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:14:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945289642] [2025-03-04 01:14:25,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:25,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:25,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:25,130 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:25,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 01:14:25,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:25,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 01:14:25,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:25,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 01:14:26,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:26,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:26,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:14:26,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:26,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 35 [2025-03-04 01:14:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 01:14:26,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042498774] [2025-03-04 01:14:26,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:14:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945289642] [2025-03-04 01:14:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945289642] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:26,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:26,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-04 01:14:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110976866] [2025-03-04 01:14:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:26,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:26,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:26,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:26,968 INFO L87 Difference]: Start difference. First operand 482 states and 535 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:27,248 INFO L93 Difference]: Finished difference Result 968 states and 1074 transitions. [2025-03-04 01:14:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:27,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:14:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:27,251 INFO L225 Difference]: With dead ends: 968 [2025-03-04 01:14:27,251 INFO L226 Difference]: Without dead ends: 627 [2025-03-04 01:14:27,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:27,252 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:27,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 493 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-04 01:14:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 463. [2025-03-04 01:14:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 382 states have (on average 1.068062827225131) internal successors, (408), 384 states have internal predecessors, (408), 52 states have call successors, (52), 28 states have call predecessors, (52), 28 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 512 transitions. [2025-03-04 01:14:27,340 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 512 transitions. Word has length 136 [2025-03-04 01:14:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 512 transitions. [2025-03-04 01:14:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 512 transitions. [2025-03-04 01:14:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:14:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:27,341 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:27,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:27,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 01:14:27,542 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1588046677, now seen corresponding path program 1 times [2025-03-04 01:14:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567974921] [2025-03-04 01:14:27,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:27,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:27,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:27,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:27,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-04 01:14:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567974921] [2025-03-04 01:14:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567974921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123635002] [2025-03-04 01:14:28,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:28,061 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:28,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 01:14:28,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:28,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:28,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:28,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 01:14:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:28,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:28,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:14:28,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:14:28,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:28,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2025-03-04 01:14:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 124 proven. 121 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 01:14:29,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123635002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:29,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:14:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-03-04 01:14:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220132037] [2025-03-04 01:14:29,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:14:29,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:14:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:29,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:14:29,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:14:29,407 INFO L87 Difference]: Start difference. First operand 463 states and 512 transitions. Second operand has 21 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-04 01:14:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:30,357 INFO L93 Difference]: Finished difference Result 827 states and 912 transitions. [2025-03-04 01:14:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:14:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) Word has length 136 [2025-03-04 01:14:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:30,359 INFO L225 Difference]: With dead ends: 827 [2025-03-04 01:14:30,359 INFO L226 Difference]: Without dead ends: 517 [2025-03-04 01:14:30,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 01:14:30,360 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 350 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:30,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 897 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-04 01:14:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 428. [2025-03-04 01:14:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 345 states have (on average 1.063768115942029) internal successors, (367), 347 states have internal predecessors, (367), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 471 transitions. [2025-03-04 01:14:30,449 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 471 transitions. Word has length 136 [2025-03-04 01:14:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:30,449 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 471 transitions. [2025-03-04 01:14:30,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-04 01:14:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 471 transitions. [2025-03-04 01:14:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:14:30,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:30,450 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:30,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 01:14:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 01:14:30,651 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1154784811, now seen corresponding path program 1 times [2025-03-04 01:14:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807892849] [2025-03-04 01:14:30,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:30,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:14:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499523494] [2025-03-04 01:14:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:30,729 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:30,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 01:14:30,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:14:30,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:14:30,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:30,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:30,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-04 01:14:30,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:31,951 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 23 treesize of output 11 [2025-03-04 01:14:32,156 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 23 treesize of output 11 [2025-03-04 01:14:32,332 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 23 treesize of output 3 [2025-03-04 01:14:32,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2025-03-04 01:14:34,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:34,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 44 [2025-03-04 01:14:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 01:14:34,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:34,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807892849] [2025-03-04 01:14:34,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:14:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499523494] [2025-03-04 01:14:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499523494] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:34,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2025-03-04 01:14:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795854027] [2025-03-04 01:14:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:34,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:34,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:14:34,810 INFO L87 Difference]: Start difference. First operand 428 states and 471 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:35,114 INFO L93 Difference]: Finished difference Result 757 states and 834 transitions. [2025-03-04 01:14:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:14:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:35,117 INFO L225 Difference]: With dead ends: 757 [2025-03-04 01:14:35,117 INFO L226 Difference]: Without dead ends: 486 [2025-03-04 01:14:35,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:14:35,118 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 53 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:35,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 551 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-04 01:14:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 428. [2025-03-04 01:14:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 345 states have (on average 1.0608695652173914) internal successors, (366), 347 states have internal predecessors, (366), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:14:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 470 transitions. [2025-03-04 01:14:35,208 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 470 transitions. Word has length 136 [2025-03-04 01:14:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 470 transitions. [2025-03-04 01:14:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 470 transitions. [2025-03-04 01:14:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:14:35,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:35,209 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:35,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:35,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:35,413 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1611508748, now seen corresponding path program 1 times [2025-03-04 01:14:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880218706] [2025-03-04 01:14:35,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:35,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:14:35,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:14:35,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:35,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:14:35,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064875201] [2025-03-04 01:14:35,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:35,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:35,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 01:14:35,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:14:35,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:14:35,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:35,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:35,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:14:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:35,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:35,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:35,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-03-04 01:14:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:35,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880218706] [2025-03-04 01:14:35,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:14:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064875201] [2025-03-04 01:14:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064875201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:14:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672866366] [2025-03-04 01:14:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:35,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:35,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:35,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:35,768 INFO L87 Difference]: Start difference. First operand 428 states and 470 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:36,046 INFO L93 Difference]: Finished difference Result 795 states and 869 transitions. [2025-03-04 01:14:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:36,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-04 01:14:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:36,049 INFO L225 Difference]: With dead ends: 795 [2025-03-04 01:14:36,049 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 01:14:36,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:36,050 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:36,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 388 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 01:14:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 321. [2025-03-04 01:14:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 268 states have (on average 1.0597014925373134) internal successors, (284), 268 states have internal predecessors, (284), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:14:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 348 transitions. [2025-03-04 01:14:36,127 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 348 transitions. Word has length 138 [2025-03-04 01:14:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 348 transitions. [2025-03-04 01:14:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 348 transitions. [2025-03-04 01:14:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:14:36,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:36,128 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:36,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 01:14:36,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 01:14:36,329 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -637466220, now seen corresponding path program 1 times [2025-03-04 01:14:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013930132] [2025-03-04 01:14:36,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:36,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:14:36,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:14:36,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:36,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:14:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31631458] [2025-03-04 01:14:36,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:36,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:36,401 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:36,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 01:14:36,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:14:36,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:14:36,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:36,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 01:14:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:36,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:14:37,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:14:37,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:14:37,914 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 23 treesize of output 11 [2025-03-04 01:14:38,221 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 32 treesize of output 23 [2025-03-04 01:14:38,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 01:14:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2025-03-04 01:14:39,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:39,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 43 [2025-03-04 01:14:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 83 proven. 290 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 01:14:39,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013930132] [2025-03-04 01:14:40,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:14:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31631458] [2025-03-04 01:14:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31631458] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [28] total 35 [2025-03-04 01:14:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996979127] [2025-03-04 01:14:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:40,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:40,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:14:40,242 INFO L87 Difference]: Start difference. First operand 321 states and 348 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:40,801 INFO L93 Difference]: Finished difference Result 578 states and 627 transitions. [2025-03-04 01:14:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:40,802 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-04 01:14:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:40,803 INFO L225 Difference]: With dead ends: 578 [2025-03-04 01:14:40,803 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:14:40,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:14:40,804 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 155 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 569 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:14:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 321. [2025-03-04 01:14:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 268 states have (on average 1.0559701492537314) internal successors, (283), 268 states have internal predecessors, (283), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:14:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 347 transitions. [2025-03-04 01:14:40,879 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 347 transitions. Word has length 138 [2025-03-04 01:14:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:40,879 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 347 transitions. [2025-03-04 01:14:40,879 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 347 transitions. [2025-03-04 01:14:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:14:40,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:40,880 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:40,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:41,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 01:14:41,080 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:41,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -480477584, now seen corresponding path program 1 times [2025-03-04 01:14:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:41,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034779210] [2025-03-04 01:14:41,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:14:41,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:14:41,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:41,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034779210] [2025-03-04 01:14:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034779210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:14:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207202830] [2025-03-04 01:14:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:14:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:42,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:14:42,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:14:42,033 INFO L87 Difference]: Start difference. First operand 321 states and 347 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:42,708 INFO L93 Difference]: Finished difference Result 374 states and 401 transitions. [2025-03-04 01:14:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:14:42,710 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 142 [2025-03-04 01:14:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:42,711 INFO L225 Difference]: With dead ends: 374 [2025-03-04 01:14:42,711 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 01:14:42,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:14:42,712 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:42,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1193 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 01:14:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 353. [2025-03-04 01:14:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0533333333333332) internal successors, (316), 300 states have internal predecessors, (316), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:14:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 380 transitions. [2025-03-04 01:14:42,791 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 380 transitions. Word has length 142 [2025-03-04 01:14:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 380 transitions. [2025-03-04 01:14:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 01:14:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 380 transitions. [2025-03-04 01:14:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:14:42,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:42,793 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:42,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:14:42,793 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:42,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2007035249, now seen corresponding path program 1 times [2025-03-04 01:14:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773959506] [2025-03-04 01:14:42,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:42,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:14:42,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:14:42,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:42,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773959506] [2025-03-04 01:14:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773959506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399864599] [2025-03-04 01:14:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:43,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:43,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:43,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:43,021 INFO L87 Difference]: Start difference. First operand 353 states and 380 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:14:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:43,276 INFO L93 Difference]: Finished difference Result 605 states and 650 transitions. [2025-03-04 01:14:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-04 01:14:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:43,278 INFO L225 Difference]: With dead ends: 605 [2025-03-04 01:14:43,278 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 01:14:43,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:43,281 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:43,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 395 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 01:14:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2025-03-04 01:14:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.05) internal successors, (315), 300 states have internal predecessors, (315), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:14:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 379 transitions. [2025-03-04 01:14:43,361 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 379 transitions. Word has length 142 [2025-03-04 01:14:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:43,361 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 379 transitions. [2025-03-04 01:14:43,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:14:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 379 transitions. [2025-03-04 01:14:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:14:43,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:43,361 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:14:43,362 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -469161457, now seen corresponding path program 1 times [2025-03-04 01:14:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469256415] [2025-03-04 01:14:43,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:43,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:14:43,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:14:43,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:43,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469256415] [2025-03-04 01:14:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469256415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679801477] [2025-03-04 01:14:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:43,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:43,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:43,600 INFO L87 Difference]: Start difference. First operand 353 states and 379 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:14:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:43,871 INFO L93 Difference]: Finished difference Result 598 states and 641 transitions. [2025-03-04 01:14:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-04 01:14:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:43,873 INFO L225 Difference]: With dead ends: 598 [2025-03-04 01:14:43,873 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 01:14:43,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:43,873 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 129 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:43,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 457 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 01:14:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2025-03-04 01:14:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.0466666666666666) internal successors, (314), 300 states have internal predecessors, (314), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:14:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 378 transitions. [2025-03-04 01:14:43,952 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 378 transitions. Word has length 142 [2025-03-04 01:14:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:43,955 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 378 transitions. [2025-03-04 01:14:43,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:14:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 378 transitions. [2025-03-04 01:14:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:14:43,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:43,955 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:43,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 01:14:43,956 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2018351376, now seen corresponding path program 1 times [2025-03-04 01:14:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410399486] [2025-03-04 01:14:43,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:43,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:14:43,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:14:43,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:43,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:14:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410399486] [2025-03-04 01:14:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410399486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:44,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:44,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:14:44,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130386290] [2025-03-04 01:14:44,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:44,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:14:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:44,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:14:44,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:44,284 INFO L87 Difference]: Start difference. First operand 353 states and 378 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:44,485 INFO L93 Difference]: Finished difference Result 356 states and 381 transitions. [2025-03-04 01:14:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:14:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2025-03-04 01:14:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:44,486 INFO L225 Difference]: With dead ends: 356 [2025-03-04 01:14:44,486 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:14:44,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:14:44,487 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:44,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:14:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:14:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:14:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:14:44,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2025-03-04 01:14:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:44,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:14:44,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:14:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:14:44,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:14:44,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:14:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 01:14:44,497 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:44,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.