./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:09:57,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:09:58,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:09:58,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:09:58,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:09:58,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:09:58,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:09:58,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:09:58,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:09:58,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:09:58,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:09:58,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:09:58,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:09:58,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:09:58,076 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:09:58,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:09:58,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:09:58,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:09:58,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:09:58,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:09:58,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:09:58,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:09:58,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:09:58,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:09:58,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:09:58,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 [2025-02-06 04:09:58,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:09:58,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:09:58,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:09:58,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:09:58,319 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:09:58,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2025-02-06 04:09:59,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2291d4683/762ac256581d4f88ad872f5e6f68502b/FLAG5d25f338d [2025-02-06 04:09:59,798 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:09:59,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2025-02-06 04:09:59,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2291d4683/762ac256581d4f88ad872f5e6f68502b/FLAG5d25f338d [2025-02-06 04:10:00,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2291d4683/762ac256581d4f88ad872f5e6f68502b [2025-02-06 04:10:00,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:10:00,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:10:00,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:00,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:10:00,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:10:00,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581d1428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00, skipping insertion in model container [2025-02-06 04:10:00,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:10:00,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2025-02-06 04:10:00,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:00,320 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:10:00,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2025-02-06 04:10:00,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:00,378 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:10:00,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00 WrapperNode [2025-02-06 04:10:00,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:00,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:00,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:10:00,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:10:00,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,427 INFO L138 Inliner]: procedures = 27, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-02-06 04:10:00,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:00,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:10:00,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:10:00,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:10:00,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,472 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-02-06 04:10:00,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:10:00,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:10:00,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:10:00,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:10:00,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (1/1) ... [2025-02-06 04:10:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:00,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:10:00,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:10:00,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:10:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:10:00,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:10:00,635 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:10:00,637 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:10:00,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem73#1;havoc property_#t~ite82#1;havoc property_#t~mem81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short112#1;havoc property_#t~mem118#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1; [2025-02-06 04:10:00,934 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-02-06 04:10:00,934 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:10:00,941 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:10:00,941 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:10:00,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:00 BoogieIcfgContainer [2025-02-06 04:10:00,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:10:00,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:10:00,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:10:00,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:10:00,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:10:00" (1/3) ... [2025-02-06 04:10:00,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc2f8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:00, skipping insertion in model container [2025-02-06 04:10:00,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:00" (2/3) ... [2025-02-06 04:10:00,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc2f8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:00, skipping insertion in model container [2025-02-06 04:10:00,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:00" (3/3) ... [2025-02-06 04:10:00,947 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-90.i [2025-02-06 04:10:00,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:10:00,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-90.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:10:00,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:10:00,996 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;@7fec3f29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:10:00,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:10:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:01,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:01,007 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:01,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1106621899, now seen corresponding path program 1 times [2025-02-06 04:10:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383991446] [2025-02-06 04:10:01,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:01,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 04:10:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383991446] [2025-02-06 04:10:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383991446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82799298] [2025-02-06 04:10:01,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:01,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:01,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:01,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:01,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:10:01,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:01,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:01,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:01,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:10:01,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 04:10:01,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82799298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:01,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:10:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889605325] [2025-02-06 04:10:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:01,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:10:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:01,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:10:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:01,549 INFO L87 Difference]: Start difference. First operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:01,567 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2025-02-06 04:10:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:10:01,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-02-06 04:10:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:01,572 INFO L225 Difference]: With dead ends: 214 [2025-02-06 04:10:01,574 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 04:10:01,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:01,580 INFO L435 NwaCegarLoop]: 154 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, 154 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-02-06 04:10:01,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 04:10:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-06 04:10:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-02-06 04:10:01,619 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2025-02-06 04:10:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-02-06 04:10:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-02-06 04:10:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 04:10:01,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:01,624 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:01,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:01,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:10:01,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -598324809, now seen corresponding path program 1 times [2025-02-06 04:10:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33893961] [2025-02-06 04:10:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 04:10:02,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:02,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33893961] [2025-02-06 04:10:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33893961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675165177] [2025-02-06 04:10:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:02,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:02,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:02,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:02,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:10:02,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 04:10:02,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 04:10:02,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:10:02,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:02,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675165177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 04:10:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674460447] [2025-02-06 04:10:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:02,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:02,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:02,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:02,423 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:02,468 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2025-02-06 04:10:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-02-06 04:10:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:02,471 INFO L225 Difference]: With dead ends: 213 [2025-02-06 04:10:02,471 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 04:10:02,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 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-02-06 04:10:02,472 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:02,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 04:10:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 04:10:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-02-06 04:10:02,487 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-02-06 04:10:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:02,491 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-02-06 04:10:02,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-02-06 04:10:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 04:10:02,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:02,492 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:02,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:02,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:02,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 441820181, now seen corresponding path program 1 times [2025-02-06 04:10:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807985165] [2025-02-06 04:10:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:02,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 04:10:02,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 04:10:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:02,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807985165] [2025-02-06 04:10:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807985165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529789296] [2025-02-06 04:10:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:03,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:03,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:03,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:03,687 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:04,107 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-02-06 04:10:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:04,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-02-06 04:10:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:04,109 INFO L225 Difference]: With dead ends: 252 [2025-02-06 04:10:04,109 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 04:10:04,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:04,110 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:04,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 361 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 04:10:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2025-02-06 04:10:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-02-06 04:10:04,119 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 155 [2025-02-06 04:10:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-02-06 04:10:04,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-02-06 04:10:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:10:04,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:04,121 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:10:04,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:04,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 980685573, now seen corresponding path program 1 times [2025-02-06 04:10:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157606196] [2025-02-06 04:10:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:04,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:10:04,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:10:04,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:04,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:05,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157606196] [2025-02-06 04:10:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157606196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878391025] [2025-02-06 04:10:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:05,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:05,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:05,142 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:05,496 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2025-02-06 04:10:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-02-06 04:10:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:05,498 INFO L225 Difference]: With dead ends: 271 [2025-02-06 04:10:05,498 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 04:10:05,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:05,499 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 228 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:05,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 564 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 04:10:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 130. [2025-02-06 04:10:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 184 transitions. [2025-02-06 04:10:05,510 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 184 transitions. Word has length 156 [2025-02-06 04:10:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:05,510 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 184 transitions. [2025-02-06 04:10:05,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 184 transitions. [2025-02-06 04:10:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 04:10:05,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:05,512 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:05,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:10:05,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:05,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1773792152, now seen corresponding path program 1 times [2025-02-06 04:10:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:05,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478931273] [2025-02-06 04:10:05,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:05,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478931273] [2025-02-06 04:10:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478931273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:07,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862973208] [2025-02-06 04:10:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:07,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:07,176 INFO L87 Difference]: Start difference. First operand 130 states and 184 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:08,047 INFO L93 Difference]: Finished difference Result 328 states and 462 transitions. [2025-02-06 04:10:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:10:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-02-06 04:10:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:08,050 INFO L225 Difference]: With dead ends: 328 [2025-02-06 04:10:08,051 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 04:10:08,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:08,052 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 214 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:08,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 842 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:10:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 04:10:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 118. [2025-02-06 04:10:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 167 transitions. [2025-02-06 04:10:08,072 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 167 transitions. Word has length 157 [2025-02-06 04:10:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 167 transitions. [2025-02-06 04:10:08,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 167 transitions. [2025-02-06 04:10:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 04:10:08,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:08,075 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:08,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:10:08,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1897135091, now seen corresponding path program 1 times [2025-02-06 04:10:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428164424] [2025-02-06 04:10:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:08,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:08,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:08,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:08,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428164424] [2025-02-06 04:10:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428164424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 04:10:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295636399] [2025-02-06 04:10:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:10:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:11,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:10:11,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:10:11,074 INFO L87 Difference]: Start difference. First operand 118 states and 167 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:12,474 INFO L93 Difference]: Finished difference Result 278 states and 393 transitions. [2025-02-06 04:10:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:10:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2025-02-06 04:10:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:12,476 INFO L225 Difference]: With dead ends: 278 [2025-02-06 04:10:12,476 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 04:10:12,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:10:12,482 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 322 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:12,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 663 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:10:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 04:10:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 123. [2025-02-06 04:10:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 101 states have internal predecessors, (134), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2025-02-06 04:10:12,526 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 157 [2025-02-06 04:10:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2025-02-06 04:10:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2025-02-06 04:10:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 04:10:12,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:12,527 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:12,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:10:12,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1391576466, now seen corresponding path program 1 times [2025-02-06 04:10:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775395599] [2025-02-06 04:10:12,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:12,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:12,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:12,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775395599] [2025-02-06 04:10:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775395599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681313303] [2025-02-06 04:10:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:12,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:12,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:12,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:12,957 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:13,290 INFO L93 Difference]: Finished difference Result 278 states and 393 transitions. [2025-02-06 04:10:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-02-06 04:10:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:13,293 INFO L225 Difference]: With dead ends: 278 [2025-02-06 04:10:13,293 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 04:10:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:13,294 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 152 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:13,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 477 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 04:10:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2025-02-06 04:10:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2025-02-06 04:10:13,325 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 157 [2025-02-06 04:10:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2025-02-06 04:10:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2025-02-06 04:10:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 04:10:13,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:13,326 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:13,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:10:13,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:13,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 900062738, now seen corresponding path program 1 times [2025-02-06 04:10:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131474238] [2025-02-06 04:10:13,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:13,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:13,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:13,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131474238] [2025-02-06 04:10:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131474238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:15,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:15,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:10:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270229795] [2025-02-06 04:10:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:15,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:10:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:15,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:10:15,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:15,167 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:15,810 INFO L93 Difference]: Finished difference Result 278 states and 391 transitions. [2025-02-06 04:10:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2025-02-06 04:10:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:15,812 INFO L225 Difference]: With dead ends: 278 [2025-02-06 04:10:15,812 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 04:10:15,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:10:15,812 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 288 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:15,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 458 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 04:10:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2025-02-06 04:10:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2025-02-06 04:10:15,824 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 157 [2025-02-06 04:10:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2025-02-06 04:10:15,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2025-02-06 04:10:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 04:10:15,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:15,825 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:15,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:10:15,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:15,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 394504113, now seen corresponding path program 1 times [2025-02-06 04:10:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394649551] [2025-02-06 04:10:15,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:15,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:16,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-02-06 04:10:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394649551] [2025-02-06 04:10:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394649551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619793553] [2025-02-06 04:10:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:16,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:16,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:10:17,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 04:10:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 04:10:17,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:17,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:17,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 04:10:17,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:17,115 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 52 treesize of output 51 [2025-02-06 04:10:17,305 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 59 treesize of output 55 [2025-02-06 04:10:18,438 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-02-06 04:10:18,746 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-02-06 04:10:19,019 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-02-06 04:10:19,314 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-02-06 04:10:19,625 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-02-06 04:10:19,940 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-02-06 04:10:20,227 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-02-06 04:10:20,674 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-06 04:10:20,675 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 1 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 04:10:20,788 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-02-06 04:10:20,841 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-02-06 04:10:20,911 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 105 treesize of output 77 [2025-02-06 04:10:20,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:20,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 83 [2025-02-06 04:10:20,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:20,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 29 [2025-02-06 04:10:21,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:21,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 65 [2025-02-06 04:10:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2025-02-06 04:10:21,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619793553] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:10:21,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 17] total 33 [2025-02-06 04:10:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081381056] [2025-02-06 04:10:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:21,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:21,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 04:10:21,620 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:22,017 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2025-02-06 04:10:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-02-06 04:10:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:22,020 INFO L225 Difference]: With dead ends: 280 [2025-02-06 04:10:22,020 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 04:10:22,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 04:10:22,022 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 52 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:22,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 978 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 04:10:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2025-02-06 04:10:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-02-06 04:10:22,039 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 157 [2025-02-06 04:10:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-02-06 04:10:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-02-06 04:10:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:22,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:22,042 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:22,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:10:22,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:22,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1864019638, now seen corresponding path program 1 times [2025-02-06 04:10:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760238852] [2025-02-06 04:10:22,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:22,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:22,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:22,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:22,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760238852] [2025-02-06 04:10:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760238852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:22,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095416082] [2025-02-06 04:10:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:22,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:22,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:22,630 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:22,923 INFO L93 Difference]: Finished difference Result 295 states and 414 transitions. [2025-02-06 04:10:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:22,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-02-06 04:10:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:22,926 INFO L225 Difference]: With dead ends: 295 [2025-02-06 04:10:22,926 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 04:10:22,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:22,927 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 226 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:22,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 329 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 04:10:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 141. [2025-02-06 04:10:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2025-02-06 04:10:22,940 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 158 [2025-02-06 04:10:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2025-02-06 04:10:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2025-02-06 04:10:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:22,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:22,944 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:22,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:10:22,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:22,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -356467829, now seen corresponding path program 1 times [2025-02-06 04:10:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027646449] [2025-02-06 04:10:22,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:22,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:22,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:22,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:22,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027646449] [2025-02-06 04:10:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027646449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:10:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124299765] [2025-02-06 04:10:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:23,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:23,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:23,939 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:24,466 INFO L93 Difference]: Finished difference Result 337 states and 474 transitions. [2025-02-06 04:10:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2025-02-06 04:10:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:24,471 INFO L225 Difference]: With dead ends: 337 [2025-02-06 04:10:24,471 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 04:10:24,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:24,473 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 348 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:24,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 372 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 04:10:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2025-02-06 04:10:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 226 transitions. [2025-02-06 04:10:24,488 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 226 transitions. Word has length 158 [2025-02-06 04:10:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 226 transitions. [2025-02-06 04:10:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 226 transitions. [2025-02-06 04:10:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:24,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:24,491 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:24,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:10:24,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1149192473, now seen corresponding path program 1 times [2025-02-06 04:10:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885392465] [2025-02-06 04:10:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:24,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885392465] [2025-02-06 04:10:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885392465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:10:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740792979] [2025-02-06 04:10:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:24,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:24,839 INFO L87 Difference]: Start difference. First operand 161 states and 226 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:25,156 INFO L93 Difference]: Finished difference Result 350 states and 491 transitions. [2025-02-06 04:10:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:25,157 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-02-06 04:10:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:25,158 INFO L225 Difference]: With dead ends: 350 [2025-02-06 04:10:25,158 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 04:10:25,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:25,159 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 202 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:25,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 404 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 04:10:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 161. [2025-02-06 04:10:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 224 transitions. [2025-02-06 04:10:25,172 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 224 transitions. Word has length 158 [2025-02-06 04:10:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 224 transitions. [2025-02-06 04:10:25,172 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 224 transitions. [2025-02-06 04:10:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:25,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:25,175 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:25,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:10:25,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash 420843817, now seen corresponding path program 1 times [2025-02-06 04:10:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:25,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749406015] [2025-02-06 04:10:25,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:25,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:25,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:25,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749406015] [2025-02-06 04:10:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749406015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:10:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596375170] [2025-02-06 04:10:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:26,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:26,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:26,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:26,462 INFO L87 Difference]: Start difference. First operand 161 states and 224 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:26,970 INFO L93 Difference]: Finished difference Result 372 states and 517 transitions. [2025-02-06 04:10:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:26,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-02-06 04:10:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:26,973 INFO L225 Difference]: With dead ends: 372 [2025-02-06 04:10:26,973 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 04:10:26,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:26,974 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 262 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:26,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 381 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 04:10:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 176. [2025-02-06 04:10:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 154 states have internal predecessors, (204), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2025-02-06 04:10:26,991 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 158 [2025-02-06 04:10:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:26,991 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2025-02-06 04:10:26,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2025-02-06 04:10:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:10:26,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:26,992 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:26,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:10:26,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1928395626, now seen corresponding path program 1 times [2025-02-06 04:10:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566017102] [2025-02-06 04:10:26,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:27,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:10:27,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:10:27,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:27,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566017102] [2025-02-06 04:10:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566017102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:10:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605996266] [2025-02-06 04:10:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:27,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:27,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:27,355 INFO L87 Difference]: Start difference. First operand 176 states and 244 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:27,685 INFO L93 Difference]: Finished difference Result 397 states and 550 transitions. [2025-02-06 04:10:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:27,686 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-02-06 04:10:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:27,687 INFO L225 Difference]: With dead ends: 397 [2025-02-06 04:10:27,687 INFO L226 Difference]: Without dead ends: 224 [2025-02-06 04:10:27,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:27,688 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 201 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:27,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 484 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-06 04:10:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 194. [2025-02-06 04:10:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 172 states have internal predecessors, (229), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 269 transitions. [2025-02-06 04:10:27,724 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 269 transitions. Word has length 158 [2025-02-06 04:10:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 269 transitions. [2025-02-06 04:10:27,725 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 269 transitions. [2025-02-06 04:10:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 04:10:27,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:27,726 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:10:27,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1077708269, now seen corresponding path program 1 times [2025-02-06 04:10:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280546520] [2025-02-06 04:10:27,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:27,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 04:10:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 04:10:27,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:27,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280546520] [2025-02-06 04:10:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280546520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:10:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523910703] [2025-02-06 04:10:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:28,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:28,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:28,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:28,180 INFO L87 Difference]: Start difference. First operand 194 states and 269 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:28,517 INFO L93 Difference]: Finished difference Result 439 states and 609 transitions. [2025-02-06 04:10:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:28,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-02-06 04:10:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:28,518 INFO L225 Difference]: With dead ends: 439 [2025-02-06 04:10:28,518 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 04:10:28,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:28,519 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 302 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:28,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 371 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 04:10:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 209. [2025-02-06 04:10:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 187 states have (on average 1.3368983957219251) internal successors, (250), 187 states have internal predecessors, (250), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2025-02-06 04:10:28,532 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 159 [2025-02-06 04:10:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:28,532 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2025-02-06 04:10:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2025-02-06 04:10:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 04:10:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:28,533 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:10:28,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1709707218, now seen corresponding path program 1 times [2025-02-06 04:10:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791718441] [2025-02-06 04:10:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:28,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 04:10:28,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 04:10:28,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:28,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791718441] [2025-02-06 04:10:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791718441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:10:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447261492] [2025-02-06 04:10:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:29,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:29,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:29,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:29,778 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:30,291 INFO L93 Difference]: Finished difference Result 469 states and 650 transitions. [2025-02-06 04:10:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2025-02-06 04:10:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:30,296 INFO L225 Difference]: With dead ends: 469 [2025-02-06 04:10:30,296 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 04:10:30,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:10:30,298 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 475 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:30,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 333 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 04:10:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 194. [2025-02-06 04:10:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 172 states have internal predecessors, (229), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 269 transitions. [2025-02-06 04:10:30,316 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 269 transitions. Word has length 159 [2025-02-06 04:10:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 269 transitions. [2025-02-06 04:10:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 269 transitions. [2025-02-06 04:10:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 04:10:30,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:30,317 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:10:30,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2084450346, now seen corresponding path program 1 times [2025-02-06 04:10:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023291906] [2025-02-06 04:10:30,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:30,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 04:10:30,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 04:10:30,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023291906] [2025-02-06 04:10:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023291906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:10:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696981643] [2025-02-06 04:10:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:10:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:31,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:10:31,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:10:31,675 INFO L87 Difference]: Start difference. First operand 194 states and 269 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:32,829 INFO L93 Difference]: Finished difference Result 561 states and 769 transitions. [2025-02-06 04:10:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:10:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2025-02-06 04:10:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:32,832 INFO L225 Difference]: With dead ends: 561 [2025-02-06 04:10:32,832 INFO L226 Difference]: Without dead ends: 370 [2025-02-06 04:10:32,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:10:32,833 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 599 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:32,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 729 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:10:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-06 04:10:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 212. [2025-02-06 04:10:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.3368421052631578) internal successors, (254), 190 states have internal predecessors, (254), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2025-02-06 04:10:32,849 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 159 [2025-02-06 04:10:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2025-02-06 04:10:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2025-02-06 04:10:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 04:10:32,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:32,851 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:32,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:10:32,851 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1105968658, now seen corresponding path program 1 times [2025-02-06 04:10:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333450374] [2025-02-06 04:10:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 04:10:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 04:10:32,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333450374] [2025-02-06 04:10:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333450374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:34,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076484194] [2025-02-06 04:10:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:34,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:34,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:34,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:34,448 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:35,134 INFO L93 Difference]: Finished difference Result 463 states and 642 transitions. [2025-02-06 04:10:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2025-02-06 04:10:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:35,136 INFO L225 Difference]: With dead ends: 463 [2025-02-06 04:10:35,136 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 04:10:35,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:10:35,137 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 263 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:35,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 411 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 04:10:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 212. [2025-02-06 04:10:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.331578947368421) internal successors, (253), 190 states have internal predecessors, (253), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 293 transitions. [2025-02-06 04:10:35,168 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 293 transitions. Word has length 159 [2025-02-06 04:10:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:35,171 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 293 transitions. [2025-02-06 04:10:35,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 293 transitions. [2025-02-06 04:10:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 04:10:35,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:35,172 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:35,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:10:35,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:35,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash 401583151, now seen corresponding path program 1 times [2025-02-06 04:10:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350812952] [2025-02-06 04:10:35,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:35,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 04:10:35,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 04:10:35,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:35,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:35,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350812952] [2025-02-06 04:10:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350812952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:35,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:10:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517016218] [2025-02-06 04:10:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:35,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:35,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:35,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:35,620 INFO L87 Difference]: Start difference. First operand 212 states and 293 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:35,982 INFO L93 Difference]: Finished difference Result 467 states and 644 transitions. [2025-02-06 04:10:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-02-06 04:10:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:35,990 INFO L225 Difference]: With dead ends: 467 [2025-02-06 04:10:35,990 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 04:10:35,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:35,991 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 211 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:35,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 522 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 04:10:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 212. [2025-02-06 04:10:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.331578947368421) internal successors, (253), 190 states have internal predecessors, (253), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 293 transitions. [2025-02-06 04:10:36,039 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 293 transitions. Word has length 159 [2025-02-06 04:10:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:36,039 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 293 transitions. [2025-02-06 04:10:36,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 293 transitions. [2025-02-06 04:10:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:36,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:36,041 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:10:36,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1855607329, now seen corresponding path program 1 times [2025-02-06 04:10:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515731435] [2025-02-06 04:10:36,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:36,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515731435] [2025-02-06 04:10:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515731435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:36,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:36,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:10:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365999565] [2025-02-06 04:10:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:36,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:36,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:36,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:36,892 INFO L87 Difference]: Start difference. First operand 212 states and 293 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:37,528 INFO L93 Difference]: Finished difference Result 521 states and 711 transitions. [2025-02-06 04:10:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:10:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:37,531 INFO L225 Difference]: With dead ends: 521 [2025-02-06 04:10:37,531 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 04:10:37,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:10:37,533 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 317 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:37,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 780 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 04:10:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 287. [2025-02-06 04:10:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 265 states have internal predecessors, (348), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 388 transitions. [2025-02-06 04:10:37,555 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 388 transitions. Word has length 160 [2025-02-06 04:10:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:37,556 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 388 transitions. [2025-02-06 04:10:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 388 transitions. [2025-02-06 04:10:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:37,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:37,557 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:37,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:10:37,557 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:37,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash 58655970, now seen corresponding path program 1 times [2025-02-06 04:10:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105533046] [2025-02-06 04:10:37,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:37,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:37,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:37,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:37,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105533046] [2025-02-06 04:10:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105533046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587708778] [2025-02-06 04:10:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:37,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:37,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:37,883 INFO L87 Difference]: Start difference. First operand 287 states and 388 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:38,154 INFO L93 Difference]: Finished difference Result 676 states and 905 transitions. [2025-02-06 04:10:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:38,156 INFO L225 Difference]: With dead ends: 676 [2025-02-06 04:10:38,157 INFO L226 Difference]: Without dead ends: 392 [2025-02-06 04:10:38,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:38,158 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 153 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:38,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 364 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-06 04:10:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 364. [2025-02-06 04:10:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 342 states have (on average 1.2982456140350878) internal successors, (444), 342 states have internal predecessors, (444), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 484 transitions. [2025-02-06 04:10:38,176 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 484 transitions. Word has length 160 [2025-02-06 04:10:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:38,178 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 484 transitions. [2025-02-06 04:10:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 484 transitions. [2025-02-06 04:10:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:38,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:38,180 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:38,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:10:38,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:38,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1306953955, now seen corresponding path program 1 times [2025-02-06 04:10:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743458547] [2025-02-06 04:10:38,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:38,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:38,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:38,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743458547] [2025-02-06 04:10:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743458547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373945976] [2025-02-06 04:10:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:39,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:39,172 INFO L87 Difference]: Start difference. First operand 364 states and 484 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:39,535 INFO L93 Difference]: Finished difference Result 748 states and 994 transitions. [2025-02-06 04:10:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-02-06 04:10:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:39,538 INFO L225 Difference]: With dead ends: 748 [2025-02-06 04:10:39,538 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 04:10:39,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:39,540 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 245 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:39,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 364 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 04:10:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 364. [2025-02-06 04:10:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 342 states have (on average 1.2923976608187135) internal successors, (442), 342 states have internal predecessors, (442), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 482 transitions. [2025-02-06 04:10:39,560 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 482 transitions. Word has length 160 [2025-02-06 04:10:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:39,560 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 482 transitions. [2025-02-06 04:10:39,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 482 transitions. [2025-02-06 04:10:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:39,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:39,562 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:10:39,562 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1637640009, now seen corresponding path program 1 times [2025-02-06 04:10:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296522200] [2025-02-06 04:10:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:39,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:39,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:39,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:39,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296522200] [2025-02-06 04:10:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296522200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:40,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253381658] [2025-02-06 04:10:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:40,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:40,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:40,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:40,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:40,421 INFO L87 Difference]: Start difference. First operand 364 states and 482 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:40,801 INFO L93 Difference]: Finished difference Result 882 states and 1156 transitions. [2025-02-06 04:10:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:40,803 INFO L225 Difference]: With dead ends: 882 [2025-02-06 04:10:40,803 INFO L226 Difference]: Without dead ends: 521 [2025-02-06 04:10:40,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:40,804 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 234 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 521 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-06 04:10:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 415. [2025-02-06 04:10:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 393 states have (on average 1.3053435114503817) internal successors, (513), 393 states have internal predecessors, (513), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 553 transitions. [2025-02-06 04:10:40,823 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 553 transitions. Word has length 160 [2025-02-06 04:10:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 553 transitions. [2025-02-06 04:10:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 553 transitions. [2025-02-06 04:10:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:40,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:40,825 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 04:10:40,825 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1020269987, now seen corresponding path program 1 times [2025-02-06 04:10:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273202188] [2025-02-06 04:10:40,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:40,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:40,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:40,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:40,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273202188] [2025-02-06 04:10:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273202188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:10:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424787896] [2025-02-06 04:10:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:10:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:41,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:10:41,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:10:41,002 INFO L87 Difference]: Start difference. First operand 415 states and 553 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:41,173 INFO L93 Difference]: Finished difference Result 786 states and 1057 transitions. [2025-02-06 04:10:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:41,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:41,175 INFO L225 Difference]: With dead ends: 786 [2025-02-06 04:10:41,175 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 04:10:41,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:41,176 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 103 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:41,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 433 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:10:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 04:10:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 338. [2025-02-06 04:10:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.3132911392405062) internal successors, (415), 316 states have internal predecessors, (415), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 455 transitions. [2025-02-06 04:10:41,209 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 455 transitions. Word has length 160 [2025-02-06 04:10:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:41,209 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 455 transitions. [2025-02-06 04:10:41,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 455 transitions. [2025-02-06 04:10:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:41,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:41,210 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:41,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:10:41,211 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 512229149, now seen corresponding path program 1 times [2025-02-06 04:10:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644787119] [2025-02-06 04:10:41,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:41,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:41,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:41,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:41,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644787119] [2025-02-06 04:10:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644787119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:42,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425031311] [2025-02-06 04:10:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:42,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:42,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:42,268 INFO L87 Difference]: Start difference. First operand 338 states and 455 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:42,650 INFO L93 Difference]: Finished difference Result 712 states and 959 transitions. [2025-02-06 04:10:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-02-06 04:10:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:42,652 INFO L225 Difference]: With dead ends: 712 [2025-02-06 04:10:42,652 INFO L226 Difference]: Without dead ends: 377 [2025-02-06 04:10:42,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:42,653 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 234 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:42,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 371 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-06 04:10:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 350. [2025-02-06 04:10:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 328 states have (on average 1.3140243902439024) internal successors, (431), 328 states have internal predecessors, (431), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 471 transitions. [2025-02-06 04:10:42,679 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 471 transitions. Word has length 160 [2025-02-06 04:10:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:42,679 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 471 transitions. [2025-02-06 04:10:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 471 transitions. [2025-02-06 04:10:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:42,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:42,681 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:42,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:10:42,681 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1644635161, now seen corresponding path program 1 times [2025-02-06 04:10:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20661892] [2025-02-06 04:10:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:42,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:42,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20661892] [2025-02-06 04:10:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20661892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 04:10:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826373590] [2025-02-06 04:10:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:10:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:43,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:10:43,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:10:43,821 INFO L87 Difference]: Start difference. First operand 350 states and 471 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:44,625 INFO L93 Difference]: Finished difference Result 756 states and 1021 transitions. [2025-02-06 04:10:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:10:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-02-06 04:10:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:44,627 INFO L225 Difference]: With dead ends: 756 [2025-02-06 04:10:44,627 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 04:10:44,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:10:44,628 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 402 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:44,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 754 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 04:10:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 352. [2025-02-06 04:10:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 330 states have (on average 1.3151515151515152) internal successors, (434), 330 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 474 transitions. [2025-02-06 04:10:44,650 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 474 transitions. Word has length 160 [2025-02-06 04:10:44,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:44,651 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 474 transitions. [2025-02-06 04:10:44,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 04:10:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 474 transitions. [2025-02-06 04:10:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:44,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:44,652 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:44,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 04:10:44,652 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash -152316198, now seen corresponding path program 1 times [2025-02-06 04:10:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867512828] [2025-02-06 04:10:44,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:44,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:44,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:44,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:44,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:44,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867512828] [2025-02-06 04:10:44,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867512828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:44,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:44,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284593005] [2025-02-06 04:10:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:44,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:44,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:44,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:44,968 INFO L87 Difference]: Start difference. First operand 352 states and 474 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:45,239 INFO L93 Difference]: Finished difference Result 816 states and 1090 transitions. [2025-02-06 04:10:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:45,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:45,241 INFO L225 Difference]: With dead ends: 816 [2025-02-06 04:10:45,241 INFO L226 Difference]: Without dead ends: 467 [2025-02-06 04:10:45,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:45,242 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 151 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:45,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 444 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-06 04:10:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 439. [2025-02-06 04:10:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 417 states have (on average 1.3021582733812949) internal successors, (543), 417 states have internal predecessors, (543), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 583 transitions. [2025-02-06 04:10:45,266 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 583 transitions. Word has length 160 [2025-02-06 04:10:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 583 transitions. [2025-02-06 04:10:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 583 transitions. [2025-02-06 04:10:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:45,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:45,267 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:10:45,267 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:45,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:45,269 INFO L85 PathProgramCache]: Analyzing trace with hash 809297819, now seen corresponding path program 1 times [2025-02-06 04:10:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10637391] [2025-02-06 04:10:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:45,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:45,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10637391] [2025-02-06 04:10:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10637391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:10:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394080908] [2025-02-06 04:10:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:10:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:45,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:10:45,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:10:45,447 INFO L87 Difference]: Start difference. First operand 439 states and 583 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:45,669 INFO L93 Difference]: Finished difference Result 834 states and 1117 transitions. [2025-02-06 04:10:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 04:10:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:45,671 INFO L225 Difference]: With dead ends: 834 [2025-02-06 04:10:45,671 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 04:10:45,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:45,672 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 103 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:45,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 433 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 04:10:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 354. [2025-02-06 04:10:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 332 states have (on average 1.3102409638554218) internal successors, (435), 332 states have internal predecessors, (435), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 475 transitions. [2025-02-06 04:10:45,696 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 475 transitions. Word has length 160 [2025-02-06 04:10:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:45,696 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 475 transitions. [2025-02-06 04:10:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 475 transitions. [2025-02-06 04:10:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:10:45,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:45,697 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:10:45,697 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1073773811, now seen corresponding path program 1 times [2025-02-06 04:10:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542930533] [2025-02-06 04:10:45,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:45,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:10:45,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:10:45,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:45,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:46,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542930533] [2025-02-06 04:10:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542930533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:10:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83428131] [2025-02-06 04:10:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:46,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:10:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:46,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:10:46,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:46,888 INFO L87 Difference]: Start difference. First operand 354 states and 475 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:47,463 INFO L93 Difference]: Finished difference Result 731 states and 980 transitions. [2025-02-06 04:10:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-02-06 04:10:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:47,465 INFO L225 Difference]: With dead ends: 731 [2025-02-06 04:10:47,465 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 04:10:47,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:10:47,466 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 274 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:47,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 618 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 04:10:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 330. [2025-02-06 04:10:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 308 states have (on average 1.3214285714285714) internal successors, (407), 308 states have internal predecessors, (407), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 447 transitions. [2025-02-06 04:10:47,487 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 447 transitions. Word has length 160 [2025-02-06 04:10:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:47,487 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 447 transitions. [2025-02-06 04:10:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 447 transitions. [2025-02-06 04:10:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 04:10:47,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:47,488 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 04:10:47,488 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1745289428, now seen corresponding path program 1 times [2025-02-06 04:10:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181230483] [2025-02-06 04:10:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 04:10:47,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 04:10:47,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:47,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:48,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181230483] [2025-02-06 04:10:48,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181230483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:48,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:48,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:10:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371315764] [2025-02-06 04:10:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:10:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:48,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:10:48,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:48,889 INFO L87 Difference]: Start difference. First operand 330 states and 447 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:49,373 INFO L93 Difference]: Finished difference Result 666 states and 901 transitions. [2025-02-06 04:10:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:49,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2025-02-06 04:10:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:49,377 INFO L225 Difference]: With dead ends: 666 [2025-02-06 04:10:49,377 INFO L226 Difference]: Without dead ends: 339 [2025-02-06 04:10:49,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:49,379 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 331 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:49,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 376 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-06 04:10:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 254. [2025-02-06 04:10:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 232 states have (on average 1.2887931034482758) internal successors, (299), 232 states have internal predecessors, (299), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:10:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 339 transitions. [2025-02-06 04:10:49,417 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 339 transitions. Word has length 161 [2025-02-06 04:10:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:49,417 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 339 transitions. [2025-02-06 04:10:49,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 339 transitions. [2025-02-06 04:10:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 04:10:49,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:49,419 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:49,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 04:10:49,419 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1131909942, now seen corresponding path program 1 times [2025-02-06 04:10:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439733436] [2025-02-06 04:10:49,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:49,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 04:10:49,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 04:10:49,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:49,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439733436] [2025-02-06 04:10:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439733436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:49,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:10:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244044634] [2025-02-06 04:10:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:49,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:49,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:10:49,620 INFO L87 Difference]: Start difference. First operand 254 states and 339 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:49,797 INFO L93 Difference]: Finished difference Result 757 states and 1012 transitions. [2025-02-06 04:10:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2025-02-06 04:10:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:49,800 INFO L225 Difference]: With dead ends: 757 [2025-02-06 04:10:49,800 INFO L226 Difference]: Without dead ends: 506 [2025-02-06 04:10:49,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:10:49,801 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 87 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:49,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 351 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:10:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-06 04:10:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 426. [2025-02-06 04:10:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 383 states have (on average 1.3054830287206267) internal successors, (500), 383 states have internal predecessors, (500), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 580 transitions. [2025-02-06 04:10:49,843 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 580 transitions. Word has length 161 [2025-02-06 04:10:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 580 transitions. [2025-02-06 04:10:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 580 transitions. [2025-02-06 04:10:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 04:10:49,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:49,844 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:49,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 04:10:49,844 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1637468567, now seen corresponding path program 1 times [2025-02-06 04:10:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:49,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226335234] [2025-02-06 04:10:49,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:49,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 04:10:49,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 04:10:49,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:49,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226335234] [2025-02-06 04:10:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226335234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:10:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327254048] [2025-02-06 04:10:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:51,252 INFO L87 Difference]: Start difference. First operand 426 states and 580 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:52,234 INFO L93 Difference]: Finished difference Result 951 states and 1286 transitions. [2025-02-06 04:10:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2025-02-06 04:10:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:52,238 INFO L225 Difference]: With dead ends: 951 [2025-02-06 04:10:52,238 INFO L226 Difference]: Without dead ends: 698 [2025-02-06 04:10:52,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:52,240 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 280 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:52,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 525 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:10:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-06 04:10:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 514. [2025-02-06 04:10:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 471 states have (on average 1.3205944798301485) internal successors, (622), 471 states have internal predecessors, (622), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 702 transitions. [2025-02-06 04:10:52,291 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 702 transitions. Word has length 161 [2025-02-06 04:10:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:52,291 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 702 transitions. [2025-02-06 04:10:52,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 702 transitions. [2025-02-06 04:10:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:10:52,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:52,292 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:52,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 04:10:52,292 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -426663617, now seen corresponding path program 1 times [2025-02-06 04:10:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554445637] [2025-02-06 04:10:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:52,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:52,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:52,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:52,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 04:10:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554445637] [2025-02-06 04:10:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554445637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047144669] [2025-02-06 04:10:52,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:52,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:52,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:52,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:10:53,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:53,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:53,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:53,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 04:10:53,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:53,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:53,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-02-06 04:10:53,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:53,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2025-02-06 04:10:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:54,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047144669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:54,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2025-02-06 04:10:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107977934] [2025-02-06 04:10:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:54,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:10:54,100 INFO L87 Difference]: Start difference. First operand 514 states and 702 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:54,779 INFO L93 Difference]: Finished difference Result 1033 states and 1376 transitions. [2025-02-06 04:10:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:54,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:10:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:54,782 INFO L225 Difference]: With dead ends: 1033 [2025-02-06 04:10:54,782 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 04:10:54,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:10:54,783 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 153 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:54,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 645 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 04:10:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 693. [2025-02-06 04:10:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 650 states have (on average 1.2938461538461539) internal successors, (841), 650 states have internal predecessors, (841), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 921 transitions. [2025-02-06 04:10:54,834 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 921 transitions. Word has length 162 [2025-02-06 04:10:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:54,835 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 921 transitions. [2025-02-06 04:10:54,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 921 transitions. [2025-02-06 04:10:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:10:54,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:54,836 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:54,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:55,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-02-06 04:10:55,036 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1316146718, now seen corresponding path program 1 times [2025-02-06 04:10:55,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466697152] [2025-02-06 04:10:55,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:55,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:55,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:55,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:55,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466697152] [2025-02-06 04:10:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466697152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:10:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633077541] [2025-02-06 04:10:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:10:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:55,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:10:55,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:55,859 INFO L87 Difference]: Start difference. First operand 693 states and 921 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:56,618 INFO L93 Difference]: Finished difference Result 1192 states and 1561 transitions. [2025-02-06 04:10:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:10:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:10:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:56,620 INFO L225 Difference]: With dead ends: 1192 [2025-02-06 04:10:56,620 INFO L226 Difference]: Without dead ends: 756 [2025-02-06 04:10:56,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-02-06 04:10:56,622 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 407 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:56,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 521 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-02-06 04:10:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 717. [2025-02-06 04:10:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 674 states have (on average 1.2922848664688427) internal successors, (871), 674 states have internal predecessors, (871), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 951 transitions. [2025-02-06 04:10:56,673 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 951 transitions. Word has length 162 [2025-02-06 04:10:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 951 transitions. [2025-02-06 04:10:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:10:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 951 transitions. [2025-02-06 04:10:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:10:56,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:56,674 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 04:10:56,674 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1890999154, now seen corresponding path program 1 times [2025-02-06 04:10:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033549526] [2025-02-06 04:10:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:56,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033549526] [2025-02-06 04:10:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033549526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:57,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:10:57,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721952664] [2025-02-06 04:10:57,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:57,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:10:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:57,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:10:57,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:10:57,113 INFO L87 Difference]: Start difference. First operand 717 states and 951 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:57,450 INFO L93 Difference]: Finished difference Result 1348 states and 1754 transitions. [2025-02-06 04:10:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:10:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:57,452 INFO L225 Difference]: With dead ends: 1348 [2025-02-06 04:10:57,452 INFO L226 Difference]: Without dead ends: 888 [2025-02-06 04:10:57,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:57,453 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 291 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:57,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 341 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-02-06 04:10:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 792. [2025-02-06 04:10:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 749 states have (on average 1.295060080106809) internal successors, (970), 749 states have internal predecessors, (970), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1050 transitions. [2025-02-06 04:10:57,504 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1050 transitions. Word has length 162 [2025-02-06 04:10:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:57,504 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1050 transitions. [2025-02-06 04:10:57,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:10:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1050 transitions. [2025-02-06 04:10:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:10:57,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:57,505 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 04:10:57,505 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:57,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -383447345, now seen corresponding path program 1 times [2025-02-06 04:10:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793714935] [2025-02-06 04:10:57,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:57,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:57,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:57,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:57,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:10:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793714935] [2025-02-06 04:10:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793714935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:59,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:59,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:10:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912743061] [2025-02-06 04:10:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:59,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:10:59,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:59,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:10:59,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:59,039 INFO L87 Difference]: Start difference. First operand 792 states and 1050 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:59,722 INFO L93 Difference]: Finished difference Result 1573 states and 2042 transitions. [2025-02-06 04:10:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:59,723 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-02-06 04:10:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:59,725 INFO L225 Difference]: With dead ends: 1573 [2025-02-06 04:10:59,725 INFO L226 Difference]: Without dead ends: 1074 [2025-02-06 04:10:59,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:59,726 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 344 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:59,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 394 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-02-06 04:10:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 829. [2025-02-06 04:10:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 786 states have (on average 1.2926208651399491) internal successors, (1016), 786 states have internal predecessors, (1016), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:10:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1096 transitions. [2025-02-06 04:10:59,776 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1096 transitions. Word has length 162 [2025-02-06 04:10:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:59,777 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1096 transitions. [2025-02-06 04:10:59,777 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 04:10:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1096 transitions. [2025-02-06 04:10:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:10:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:59,778 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:59,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 04:10:59,778 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -395643810, now seen corresponding path program 1 times [2025-02-06 04:10:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520655409] [2025-02-06 04:10:59,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:59,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:10:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:10:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520655409] [2025-02-06 04:11:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520655409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 04:11:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561208750] [2025-02-06 04:11:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:11:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:00,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:11:00,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:11:00,532 INFO L87 Difference]: Start difference. First operand 829 states and 1096 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:01,384 INFO L93 Difference]: Finished difference Result 1410 states and 1835 transitions. [2025-02-06 04:11:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 04:11:01,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:11:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:01,387 INFO L225 Difference]: With dead ends: 1410 [2025-02-06 04:11:01,387 INFO L226 Difference]: Without dead ends: 877 [2025-02-06 04:11:01,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:11:01,389 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 276 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:01,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 655 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:11:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-06 04:11:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 857. [2025-02-06 04:11:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 814 states have (on average 1.2825552825552826) internal successors, (1044), 814 states have internal predecessors, (1044), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:11:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1124 transitions. [2025-02-06 04:11:01,440 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1124 transitions. Word has length 162 [2025-02-06 04:11:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:01,440 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1124 transitions. [2025-02-06 04:11:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1124 transitions. [2025-02-06 04:11:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:01,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:01,442 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:01,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 04:11:01,442 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:01,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1347166525, now seen corresponding path program 1 times [2025-02-06 04:11:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:01,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190460528] [2025-02-06 04:11:01,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 04:11:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190460528] [2025-02-06 04:11:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190460528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903503025] [2025-02-06 04:11:01,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:01,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:11:01,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:11:02,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:11:02,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:11:02,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:02,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:02,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:02,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 04:11:02,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:02,207 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 52 treesize of output 51 [2025-02-06 04:11:02,289 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 59 treesize of output 55 [2025-02-06 04:11:03,136 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 73 treesize of output 49 [2025-02-06 04:11:03,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:11:03,601 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 2 case distinctions, treesize of input 83 treesize of output 71 [2025-02-06 04:11:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:03,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903503025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:11:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 23 [2025-02-06 04:11:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986080484] [2025-02-06 04:11:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:03,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:11:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:03,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:11:03,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:11:03,686 INFO L87 Difference]: Start difference. First operand 857 states and 1124 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:04,671 INFO L93 Difference]: Finished difference Result 1759 states and 2228 transitions. [2025-02-06 04:11:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:11:04,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:11:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:04,674 INFO L225 Difference]: With dead ends: 1759 [2025-02-06 04:11:04,674 INFO L226 Difference]: Without dead ends: 1198 [2025-02-06 04:11:04,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-02-06 04:11:04,675 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 170 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:04,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1132 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:11:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-02-06 04:11:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 941. [2025-02-06 04:11:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 898 states have (on average 1.269487750556793) internal successors, (1140), 898 states have internal predecessors, (1140), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:11:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1220 transitions. [2025-02-06 04:11:04,728 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1220 transitions. Word has length 162 [2025-02-06 04:11:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1220 transitions. [2025-02-06 04:11:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1220 transitions. [2025-02-06 04:11:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:04,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:04,729 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:04,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:11:04,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 04:11:04,933 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:04,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -149005172, now seen corresponding path program 1 times [2025-02-06 04:11:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126942500] [2025-02-06 04:11:04,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:04,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126942500] [2025-02-06 04:11:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126942500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:11:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13627704] [2025-02-06 04:11:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:05,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:11:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:11:05,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:11:05,882 INFO L87 Difference]: Start difference. First operand 941 states and 1220 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:06,379 INFO L93 Difference]: Finished difference Result 1859 states and 2389 transitions. [2025-02-06 04:11:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:06,379 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:11:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:06,382 INFO L225 Difference]: With dead ends: 1859 [2025-02-06 04:11:06,382 INFO L226 Difference]: Without dead ends: 1294 [2025-02-06 04:11:06,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:11:06,386 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 261 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:06,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 438 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:11:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-02-06 04:11:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 981. [2025-02-06 04:11:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 938 states have (on average 1.2814498933901919) internal successors, (1202), 938 states have internal predecessors, (1202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:11:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1282 transitions. [2025-02-06 04:11:06,460 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1282 transitions. Word has length 162 [2025-02-06 04:11:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:06,460 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1282 transitions. [2025-02-06 04:11:06,460 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1282 transitions. [2025-02-06 04:11:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:06,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:06,466 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:06,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 04:11:06,466 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:06,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1322374230, now seen corresponding path program 1 times [2025-02-06 04:11:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:06,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115711768] [2025-02-06 04:11:06,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:06,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:06,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:06,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:06,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115711768] [2025-02-06 04:11:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115711768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:11:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053808292] [2025-02-06 04:11:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:07,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:11:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:07,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:11:07,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:11:07,339 INFO L87 Difference]: Start difference. First operand 981 states and 1282 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:07,987 INFO L93 Difference]: Finished difference Result 2002 states and 2569 transitions. [2025-02-06 04:11:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:11:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:11:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:07,991 INFO L225 Difference]: With dead ends: 2002 [2025-02-06 04:11:07,991 INFO L226 Difference]: Without dead ends: 1421 [2025-02-06 04:11:07,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:11:07,993 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 418 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:07,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 597 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:11:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-02-06 04:11:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1131. [2025-02-06 04:11:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1088 states have (on average 1.2830882352941178) internal successors, (1396), 1088 states have internal predecessors, (1396), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 04:11:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1476 transitions. [2025-02-06 04:11:08,056 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1476 transitions. Word has length 162 [2025-02-06 04:11:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:08,056 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1476 transitions. [2025-02-06 04:11:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1476 transitions. [2025-02-06 04:11:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:08,057 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 04:11:08,057 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:08,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1872992194, now seen corresponding path program 1 times [2025-02-06 04:11:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988228109] [2025-02-06 04:11:08,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:08,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:08,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:08,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:08,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988228109] [2025-02-06 04:11:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988228109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:11:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79997472] [2025-02-06 04:11:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:09,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:11:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:09,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:11:09,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:11:09,474 INFO L87 Difference]: Start difference. First operand 1131 states and 1476 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:10,022 INFO L93 Difference]: Finished difference Result 1842 states and 2382 transitions. [2025-02-06 04:11:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:11:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:11:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:10,025 INFO L225 Difference]: With dead ends: 1842 [2025-02-06 04:11:10,025 INFO L226 Difference]: Without dead ends: 1185 [2025-02-06 04:11:10,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:11:10,026 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 609 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:10,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 369 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:11:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-02-06 04:11:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1129. [2025-02-06 04:11:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1082 states have (on average 1.27818853974122) internal successors, (1383), 1083 states have internal predecessors, (1383), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1467 transitions. [2025-02-06 04:11:10,087 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1467 transitions. Word has length 162 [2025-02-06 04:11:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:10,087 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1467 transitions. [2025-02-06 04:11:10,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1467 transitions. [2025-02-06 04:11:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:10,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:10,088 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:10,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 04:11:10,088 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:10,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 59301101, now seen corresponding path program 1 times [2025-02-06 04:11:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958809279] [2025-02-06 04:11:10,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:10,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:10,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958809279] [2025-02-06 04:11:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958809279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:11:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347200313] [2025-02-06 04:11:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:11:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:11:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:11:11,588 INFO L87 Difference]: Start difference. First operand 1129 states and 1467 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:12,319 INFO L93 Difference]: Finished difference Result 2058 states and 2664 transitions. [2025-02-06 04:11:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:11:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:11:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:12,323 INFO L225 Difference]: With dead ends: 2058 [2025-02-06 04:11:12,324 INFO L226 Difference]: Without dead ends: 1403 [2025-02-06 04:11:12,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:11:12,325 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 189 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:12,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 584 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:11:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-06 04:11:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1239. [2025-02-06 04:11:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1192 states have (on average 1.2860738255033557) internal successors, (1533), 1193 states have internal predecessors, (1533), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1617 transitions. [2025-02-06 04:11:12,387 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1617 transitions. Word has length 162 [2025-02-06 04:11:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:12,387 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1617 transitions. [2025-02-06 04:11:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1617 transitions. [2025-02-06 04:11:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:12,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:12,388 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 04:11:12,389 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1566852910, now seen corresponding path program 1 times [2025-02-06 04:11:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21053987] [2025-02-06 04:11:12,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:12,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:12,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:12,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:12,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21053987] [2025-02-06 04:11:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21053987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:12,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:11:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980084735] [2025-02-06 04:11:12,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:11:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:12,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:11:12,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:11:12,848 INFO L87 Difference]: Start difference. First operand 1239 states and 1617 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:13,279 INFO L93 Difference]: Finished difference Result 2081 states and 2682 transitions. [2025-02-06 04:11:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:13,279 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:11:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:13,283 INFO L225 Difference]: With dead ends: 2081 [2025-02-06 04:11:13,283 INFO L226 Difference]: Without dead ends: 1372 [2025-02-06 04:11:13,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:11:13,286 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 160 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:13,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 502 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:11:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-02-06 04:11:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1240. [2025-02-06 04:11:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1193 states have (on average 1.2799664710813077) internal successors, (1527), 1194 states have internal predecessors, (1527), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1611 transitions. [2025-02-06 04:11:13,351 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1611 transitions. Word has length 162 [2025-02-06 04:11:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:13,351 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1611 transitions. [2025-02-06 04:11:13,351 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1611 transitions. [2025-02-06 04:11:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:13,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:13,352 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 04:11:13,352 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:13,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash 710184574, now seen corresponding path program 1 times [2025-02-06 04:11:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289183738] [2025-02-06 04:11:13,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:13,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:13,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:13,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289183738] [2025-02-06 04:11:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289183738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:14,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:11:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558825654] [2025-02-06 04:11:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:11:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:14,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:11:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:11:14,597 INFO L87 Difference]: Start difference. First operand 1240 states and 1611 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:15,066 INFO L93 Difference]: Finished difference Result 2032 states and 2624 transitions. [2025-02-06 04:11:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-02-06 04:11:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:15,070 INFO L225 Difference]: With dead ends: 2032 [2025-02-06 04:11:15,070 INFO L226 Difference]: Without dead ends: 1306 [2025-02-06 04:11:15,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:11:15,071 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 273 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:15,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 428 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:11:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-02-06 04:11:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1185. [2025-02-06 04:11:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1138 states have (on average 1.2934973637961336) internal successors, (1472), 1139 states have internal predecessors, (1472), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1556 transitions. [2025-02-06 04:11:15,137 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1556 transitions. Word has length 162 [2025-02-06 04:11:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:15,137 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1556 transitions. [2025-02-06 04:11:15,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 04:11:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1556 transitions. [2025-02-06 04:11:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:11:15,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:15,139 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:15,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 04:11:15,139 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1841972387, now seen corresponding path program 1 times [2025-02-06 04:11:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539471909] [2025-02-06 04:11:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:15,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 04:11:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539471909] [2025-02-06 04:11:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539471909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544519680] [2025-02-06 04:11:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:11:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:11:15,732 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:11:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:11:15,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:11:15,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:11:15,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:15,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:15,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 04:11:15,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:17,487 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-02-06 04:11:17,718 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-02-06 04:11:17,780 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-02-06 04:11:17,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:17,837 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 73 treesize of output 49 [2025-02-06 04:11:18,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:11:18,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2025-02-06 04:11:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 04:11:18,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:11:18,787 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 224 treesize of output 200 [2025-02-06 04:11:18,816 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 27 [2025-02-06 04:11:18,836 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 27 [2025-02-06 04:11:18,857 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 27 [2025-02-06 04:11:18,876 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 27 [2025-02-06 04:11:18,898 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 27 [2025-02-06 04:11:18,920 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 27 [2025-02-06 04:11:18,940 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 27 [2025-02-06 04:11:18,960 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 27 [2025-02-06 04:11:18,982 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 27 [2025-02-06 04:11:19,001 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 27 [2025-02-06 04:11:19,022 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 27 [2025-02-06 04:11:19,044 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 27 [2025-02-06 04:11:19,065 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 27 [2025-02-06 04:11:19,091 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 27 [2025-02-06 04:11:19,112 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 27 [2025-02-06 04:11:19,133 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 27 [2025-02-06 04:11:19,153 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 27 [2025-02-06 04:11:19,172 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 27 [2025-02-06 04:11:19,197 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 27 [2025-02-06 04:11:19,217 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 27 [2025-02-06 04:11:19,241 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 27 [2025-02-06 04:11:19,261 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 27 [2025-02-06 04:11:19,281 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 27 [2025-02-06 04:11:19,304 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 27 [2025-02-06 04:11:19,325 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 27 [2025-02-06 04:11:19,344 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 27 [2025-02-06 04:11:19,365 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 27 [2025-02-06 04:11:19,387 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 27 [2025-02-06 04:11:19,413 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 27 [2025-02-06 04:11:19,439 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 27 [2025-02-06 04:11:19,465 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 27 [2025-02-06 04:11:19,491 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 27 [2025-02-06 04:11:19,517 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 27 [2025-02-06 04:11:19,543 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 27 [2025-02-06 04:11:19,570 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 27 [2025-02-06 04:11:19,595 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 27 [2025-02-06 04:11:19,619 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 27 [2025-02-06 04:11:19,643 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 27 [2025-02-06 04:11:19,668 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 27 [2025-02-06 04:11:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544519680] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:11:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 11] total 27 [2025-02-06 04:11:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789265074] [2025-02-06 04:11:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:11:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:19,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:11:19,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:11:19,693 INFO L87 Difference]: Start difference. First operand 1185 states and 1556 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:20,346 INFO L93 Difference]: Finished difference Result 1946 states and 2537 transitions. [2025-02-06 04:11:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:11:20,346 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-02-06 04:11:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:20,350 INFO L225 Difference]: With dead ends: 1946 [2025-02-06 04:11:20,350 INFO L226 Difference]: Without dead ends: 1244 [2025-02-06 04:11:20,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 270 SyntacticMatches, 42 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-02-06 04:11:20,351 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 128 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:20,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 586 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:11:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-02-06 04:11:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1126. [2025-02-06 04:11:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1079 states have (on average 1.2974976830398517) internal successors, (1400), 1080 states have internal predecessors, (1400), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1484 transitions. [2025-02-06 04:11:20,418 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1484 transitions. Word has length 162 [2025-02-06 04:11:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:20,418 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1484 transitions. [2025-02-06 04:11:20,418 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1484 transitions. [2025-02-06 04:11:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:11:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:20,419 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:20,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:11:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-02-06 04:11:20,624 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1595945039, now seen corresponding path program 1 times [2025-02-06 04:11:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685265307] [2025-02-06 04:11:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:20,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:11:20,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:11:20,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:20,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685265307] [2025-02-06 04:11:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685265307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:11:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079435913] [2025-02-06 04:11:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:11:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:21,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:11:21,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:11:21,261 INFO L87 Difference]: Start difference. First operand 1126 states and 1484 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:21,676 INFO L93 Difference]: Finished difference Result 1955 states and 2547 transitions. [2025-02-06 04:11:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-02-06 04:11:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:21,681 INFO L225 Difference]: With dead ends: 1955 [2025-02-06 04:11:21,681 INFO L226 Difference]: Without dead ends: 1252 [2025-02-06 04:11:21,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:11:21,682 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 176 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:21,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 464 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:11:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-02-06 04:11:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1164. [2025-02-06 04:11:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1117 states have (on average 1.2927484333034915) internal successors, (1444), 1118 states have internal predecessors, (1444), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:11:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1528 transitions. [2025-02-06 04:11:21,750 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1528 transitions. Word has length 163 [2025-02-06 04:11:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:21,751 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1528 transitions. [2025-02-06 04:11:21,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 04:11:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1528 transitions. [2025-02-06 04:11:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:11:21,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:21,752 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:11:21,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 04:11:21,752 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash -88393230, now seen corresponding path program 1 times [2025-02-06 04:11:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:11:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250693022] [2025-02-06 04:11:21,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:11:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:11:21,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:11:21,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:21,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 04:11:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:11:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250693022] [2025-02-06 04:11:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250693022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:11:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694994809] [2025-02-06 04:11:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:11:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:11:22,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:11:22,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:11:22,968 INFO L87 Difference]: Start difference. First operand 1164 states and 1528 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)