./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:49:15,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:49:15,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:49:15,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:49:15,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:49:15,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:49:15,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:49:15,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:49:15,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:49:15,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:49:15,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:49:15,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:49:15,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:49:15,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:49:15,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:49:15,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:49:15,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:49:15,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:49:15,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:15,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:49:15,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b23e56f7fb6f5a6e6082a7d837c764b9113a3019ea380051f143af60aabcf6a [2025-03-17 05:49:16,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:49:16,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:49:16,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:49:16,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:49:16,120 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:49:16,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2025-03-17 05:49:17,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7faefdb88/d41377d2756e4978adbfc30f744ad123/FLAG59f27d4a8 [2025-03-17 05:49:17,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:49:17,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i [2025-03-17 05:49:17,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7faefdb88/d41377d2756e4978adbfc30f744ad123/FLAG59f27d4a8 [2025-03-17 05:49:17,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7faefdb88/d41377d2756e4978adbfc30f744ad123 [2025-03-17 05:49:17,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:49:17,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:49:17,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:17,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:49:17,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:49:17,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b865710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17, skipping insertion in model container [2025-03-17 05:49:17,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:49:17,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i[916,929] [2025-03-17 05:49:17,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:17,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:49:17,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-66.i[916,929] [2025-03-17 05:49:17,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:17,949 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:49:17,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17 WrapperNode [2025-03-17 05:49:17,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:17,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:17,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:49:17,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:49:17,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:17,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,000 INFO L138 Inliner]: procedures = 26, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-03-17 05:49:18,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:18,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:49:18,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:49:18,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:49:18,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,039 INFO L175 MemorySlicer]: Split 123 memory accesses to 13 slices as follows [2, 7, 10, 8, 14, 8, 16, 8, 8, 14, 8, 13, 7]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1]. [2025-03-17 05:49:18,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:49:18,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:49:18,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:49:18,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:49:18,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (1/1) ... [2025-03-17 05:49:18,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:18,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:49:18,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:49:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:49:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:49:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:49:18,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:49:18,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:49:18,569 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-17 05:49:18,604 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-17 05:49:18,605 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:49:18,613 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:49:18,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:49:18,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:18 BoogieIcfgContainer [2025-03-17 05:49:18,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:49:18,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:49:18,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:49:18,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:49:18,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:49:17" (1/3) ... [2025-03-17 05:49:18,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b52862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:18, skipping insertion in model container [2025-03-17 05:49:18,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:17" (2/3) ... [2025-03-17 05:49:18,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b52862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:18, skipping insertion in model container [2025-03-17 05:49:18,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:18" (3/3) ... [2025-03-17 05:49:18,622 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-66.i [2025-03-17 05:49:18,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:49:18,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:49:18,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:49:18,690 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;@1e17d6fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:49:18,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:49:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:49:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:49:18,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:18,703 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:18,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1956825230, now seen corresponding path program 1 times [2025-03-17 05:49:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:18,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-03-17 05:49:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:18,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:49:18,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:49:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:49:18,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:18,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-03-17 05:49:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603386289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195152415] [2025-03-17 05:49:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:18,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:18,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:49:19,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:49:19,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:49:19,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:19,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:49:19,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:49:19,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195152415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:49:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482052415] [2025-03-17 05:49:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:49:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:49:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:19,231 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:49:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:19,249 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2025-03-17 05:49:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:49:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2025-03-17 05:49:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:19,254 INFO L225 Difference]: With dead ends: 157 [2025-03-17 05:49:19,254 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 05:49:19,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:19,257 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:19,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 05:49:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 05:49:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:49:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-17 05:49:19,282 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 105 [2025-03-17 05:49:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:19,283 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-17 05:49:19,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:49:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-17 05:49:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:49:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:19,286 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:19,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:49:19,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:49:19,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1230051520, now seen corresponding path program 1 times [2025-03-17 05:49:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561027225] [2025-03-17 05:49:19,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:19,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:49:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:49:19,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:19,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561027225] [2025-03-17 05:49:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561027225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95722283] [2025-03-17 05:49:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:19,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:19,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:19,772 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:19,823 INFO L93 Difference]: Finished difference Result 158 states and 231 transitions. [2025-03-17 05:49:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:49:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:19,826 INFO L225 Difference]: With dead ends: 158 [2025-03-17 05:49:19,827 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 05:49:19,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:19,828 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:19,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 05:49:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-03-17 05:49:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:49:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 05:49:19,856 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 105 [2025-03-17 05:49:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 05:49:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 05:49:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:49:19,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:19,863 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:19,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:49:19,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:19,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2117555201, now seen corresponding path program 1 times [2025-03-17 05:49:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762462979] [2025-03-17 05:49:19,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:19,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:49:20,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:49:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:20,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762462979] [2025-03-17 05:49:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762462979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:20,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164559106] [2025-03-17 05:49:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:20,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:20,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:20,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:20,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:20,185 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:20,212 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-17 05:49:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:49:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:20,214 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:49:20,214 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:49:20,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:20,217 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:20,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:49:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:49:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:49:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-17 05:49:20,225 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 105 [2025-03-17 05:49:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:20,225 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-17 05:49:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-17 05:49:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:49:20,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:20,227 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:20,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:49:20,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2118478722, now seen corresponding path program 1 times [2025-03-17 05:49:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219120270] [2025-03-17 05:49:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:20,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:49:20,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:49:20,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:20,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219120270] [2025-03-17 05:49:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219120270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099800473] [2025-03-17 05:49:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:20,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:20,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:20,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:20,569 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:20,689 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2025-03-17 05:49:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2025-03-17 05:49:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:20,691 INFO L225 Difference]: With dead ends: 244 [2025-03-17 05:49:20,691 INFO L226 Difference]: Without dead ends: 163 [2025-03-17 05:49:20,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:20,692 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 77 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:20,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 314 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-17 05:49:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-03-17 05:49:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:49:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2025-03-17 05:49:20,715 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 105 [2025-03-17 05:49:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2025-03-17 05:49:20,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2025-03-17 05:49:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:49:20,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:20,717 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:49:20,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1912567674, now seen corresponding path program 1 times [2025-03-17 05:49:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070944381] [2025-03-17 05:49:20,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:20,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:49:20,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:49:20,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:20,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070944381] [2025-03-17 05:49:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070944381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:49:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331832] [2025-03-17 05:49:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:22,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:49:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:22,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:49:22,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:22,642 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:24,066 INFO L93 Difference]: Finished difference Result 561 states and 801 transitions. [2025-03-17 05:49:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 05:49:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2025-03-17 05:49:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:24,069 INFO L225 Difference]: With dead ends: 561 [2025-03-17 05:49:24,069 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 05:49:24,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:49:24,070 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1200 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:24,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 847 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:49:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 05:49:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 171. [2025-03-17 05:49:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 140 states have internal predecessors, (190), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:49:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2025-03-17 05:49:24,095 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 106 [2025-03-17 05:49:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2025-03-17 05:49:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2025-03-17 05:49:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:49:24,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:24,098 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:24,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:49:24,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1619164667, now seen corresponding path program 1 times [2025-03-17 05:49:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105798304] [2025-03-17 05:49:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:49:24,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:49:24,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105798304] [2025-03-17 05:49:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105798304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:24,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680241664] [2025-03-17 05:49:24,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:24,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:24,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:24,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:24,602 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:25,230 INFO L93 Difference]: Finished difference Result 570 states and 799 transitions. [2025-03-17 05:49:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2025-03-17 05:49:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:25,234 INFO L225 Difference]: With dead ends: 570 [2025-03-17 05:49:25,234 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 05:49:25,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:49:25,235 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 350 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:25,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 646 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:49:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 05:49:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 258. [2025-03-17 05:49:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 205 states have internal predecessors, (264), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:49:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 360 transitions. [2025-03-17 05:49:25,274 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 360 transitions. Word has length 106 [2025-03-17 05:49:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:25,275 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 360 transitions. [2025-03-17 05:49:25,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 360 transitions. [2025-03-17 05:49:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:49:25,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:25,277 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:49:25,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:25,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 753371846, now seen corresponding path program 1 times [2025-03-17 05:49:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757443799] [2025-03-17 05:49:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:25,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:49:25,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:49:25,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:25,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:25,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757443799] [2025-03-17 05:49:25,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757443799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:25,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:25,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934547210] [2025-03-17 05:49:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:25,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:25,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:25,569 INFO L87 Difference]: Start difference. First operand 258 states and 360 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:25,696 INFO L93 Difference]: Finished difference Result 438 states and 610 transitions. [2025-03-17 05:49:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:25,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:49:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:25,700 INFO L225 Difference]: With dead ends: 438 [2025-03-17 05:49:25,700 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 05:49:25,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:25,701 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 105 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:25,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 400 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 05:49:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2025-03-17 05:49:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 147 states have internal predecessors, (189), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:49:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2025-03-17 05:49:25,729 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 107 [2025-03-17 05:49:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:25,729 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2025-03-17 05:49:25,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2025-03-17 05:49:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:25,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:25,731 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:25,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:49:25,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:25,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 496984735, now seen corresponding path program 1 times [2025-03-17 05:49:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328810878] [2025-03-17 05:49:25,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:25,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328810878] [2025-03-17 05:49:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328810878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680273471] [2025-03-17 05:49:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:26,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:26,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:26,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:26,192 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:26,892 INFO L93 Difference]: Finished difference Result 459 states and 635 transitions. [2025-03-17 05:49:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:49:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:49:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:26,894 INFO L225 Difference]: With dead ends: 459 [2025-03-17 05:49:26,894 INFO L226 Difference]: Without dead ends: 364 [2025-03-17 05:49:26,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:49:26,895 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 323 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:26,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 873 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:49:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-17 05:49:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 217. [2025-03-17 05:49:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 170 states have internal predecessors, (218), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2025-03-17 05:49:26,935 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 109 [2025-03-17 05:49:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2025-03-17 05:49:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2025-03-17 05:49:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:26,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:26,950 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:49:26,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 203581728, now seen corresponding path program 1 times [2025-03-17 05:49:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575886850] [2025-03-17 05:49:26,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:26,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:27,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575886850] [2025-03-17 05:49:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575886850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:27,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:27,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250243217] [2025-03-17 05:49:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:27,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:27,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:27,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:27,367 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:27,451 INFO L93 Difference]: Finished difference Result 358 states and 500 transitions. [2025-03-17 05:49:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:49:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:27,454 INFO L225 Difference]: With dead ends: 358 [2025-03-17 05:49:27,454 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 05:49:27,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:27,457 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 51 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:27,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 475 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 05:49:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2025-03-17 05:49:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 170 states have internal predecessors, (218), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2025-03-17 05:49:27,486 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 109 [2025-03-17 05:49:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:27,486 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2025-03-17 05:49:27,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2025-03-17 05:49:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:27,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:27,487 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:27,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:49:27,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 708335648, now seen corresponding path program 1 times [2025-03-17 05:49:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286015582] [2025-03-17 05:49:27,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:27,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:27,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:27,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:27,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:27,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286015582] [2025-03-17 05:49:27,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286015582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:27,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207406384] [2025-03-17 05:49:27,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:27,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:27,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:27,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:27,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:27,777 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:28,125 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2025-03-17 05:49:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:49:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:49:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:28,128 INFO L225 Difference]: With dead ends: 392 [2025-03-17 05:49:28,128 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:49:28,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:28,129 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 273 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:28,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 590 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:49:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 203. [2025-03-17 05:49:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 155 states have (on average 1.264516129032258) internal successors, (196), 156 states have internal predecessors, (196), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2025-03-17 05:49:28,157 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 109 [2025-03-17 05:49:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:28,157 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2025-03-17 05:49:28,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2025-03-17 05:49:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:49:28,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:28,159 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:28,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:49:28,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1131588889, now seen corresponding path program 1 times [2025-03-17 05:49:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979150924] [2025-03-17 05:49:28,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:28,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:28,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:28,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:49:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979150924] [2025-03-17 05:49:28,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979150924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:28,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726685745] [2025-03-17 05:49:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:28,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:28,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:28,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:28,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:49:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:49:28,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:49:28,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:28,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:28,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:49:28,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:28,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726685745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:49:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376877250] [2025-03-17 05:49:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:28,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:28,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:28,476 INFO L87 Difference]: Start difference. First operand 203 states and 280 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:28,546 INFO L93 Difference]: Finished difference Result 379 states and 522 transitions. [2025-03-17 05:49:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:49:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:28,549 INFO L225 Difference]: With dead ends: 379 [2025-03-17 05:49:28,549 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 05:49:28,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:28,551 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:28,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 05:49:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-17 05:49:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 162 states have internal predecessors, (202), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2025-03-17 05:49:28,573 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 286 transitions. Word has length 109 [2025-03-17 05:49:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 286 transitions. [2025-03-17 05:49:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2025-03-17 05:49:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:49:28,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:28,574 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:28,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:49:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 05:49:28,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 531032507, now seen corresponding path program 1 times [2025-03-17 05:49:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656668457] [2025-03-17 05:49:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:49:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:49:28,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656668457] [2025-03-17 05:49:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656668457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699655208] [2025-03-17 05:49:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:29,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:29,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:29,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:29,086 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:29,403 INFO L93 Difference]: Finished difference Result 489 states and 669 transitions. [2025-03-17 05:49:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:49:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:49:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:29,405 INFO L225 Difference]: With dead ends: 489 [2025-03-17 05:49:29,406 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 05:49:29,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:49:29,408 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 329 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:29,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 668 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 05:49:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 245. [2025-03-17 05:49:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2025-03-17 05:49:29,430 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 111 [2025-03-17 05:49:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2025-03-17 05:49:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2025-03-17 05:49:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:49:29,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:29,432 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:49:29,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2038584316, now seen corresponding path program 1 times [2025-03-17 05:49:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088159187] [2025-03-17 05:49:29,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:29,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:49:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:49:29,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:29,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088159187] [2025-03-17 05:49:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088159187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275677067] [2025-03-17 05:49:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:29,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:29,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:29,877 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:30,259 INFO L93 Difference]: Finished difference Result 474 states and 640 transitions. [2025-03-17 05:49:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:49:30,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:49:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:30,263 INFO L225 Difference]: With dead ends: 474 [2025-03-17 05:49:30,263 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 05:49:30,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:30,264 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 135 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:30,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 930 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 05:49:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 226. [2025-03-17 05:49:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 193 states have internal predecessors, (255), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:49:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 311 transitions. [2025-03-17 05:49:30,295 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 311 transitions. Word has length 111 [2025-03-17 05:49:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 311 transitions. [2025-03-17 05:49:30,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 311 transitions. [2025-03-17 05:49:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:49:30,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:30,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:30,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:49:30,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:30,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash -410945776, now seen corresponding path program 1 times [2025-03-17 05:49:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736551939] [2025-03-17 05:49:30,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:49:30,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:49:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:30,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736551939] [2025-03-17 05:49:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736551939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269103072] [2025-03-17 05:49:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:30,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:30,425 INFO L87 Difference]: Start difference. First operand 226 states and 311 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:30,497 INFO L93 Difference]: Finished difference Result 519 states and 711 transitions. [2025-03-17 05:49:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:49:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:30,502 INFO L225 Difference]: With dead ends: 519 [2025-03-17 05:49:30,502 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:49:30,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:30,503 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:30,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 459 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:49:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-03-17 05:49:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 252 states have (on average 1.3214285714285714) internal successors, (333), 253 states have internal predecessors, (333), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:49:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 397 transitions. [2025-03-17 05:49:30,531 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 397 transitions. Word has length 112 [2025-03-17 05:49:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:30,531 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 397 transitions. [2025-03-17 05:49:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 397 transitions. [2025-03-17 05:49:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:49:30,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:30,532 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:30,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:49:30,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:30,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 475438282, now seen corresponding path program 1 times [2025-03-17 05:49:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985481325] [2025-03-17 05:49:30,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:49:30,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:49:30,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:30,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985481325] [2025-03-17 05:49:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985481325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115533322] [2025-03-17 05:49:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:30,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:30,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:30,708 INFO L87 Difference]: Start difference. First operand 291 states and 397 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:30,786 INFO L93 Difference]: Finished difference Result 583 states and 794 transitions. [2025-03-17 05:49:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:49:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:30,788 INFO L225 Difference]: With dead ends: 583 [2025-03-17 05:49:30,788 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 05:49:30,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:30,789 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 154 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:30,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 333 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 05:49:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2025-03-17 05:49:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 252 states have (on average 1.3174603174603174) internal successors, (332), 253 states have internal predecessors, (332), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:49:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 396 transitions. [2025-03-17 05:49:30,815 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 396 transitions. Word has length 112 [2025-03-17 05:49:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:30,815 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 396 transitions. [2025-03-17 05:49:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 396 transitions. [2025-03-17 05:49:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:49:30,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:30,816 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:30,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:49:30,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1096606033, now seen corresponding path program 1 times [2025-03-17 05:49:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:30,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525867225] [2025-03-17 05:49:30,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:49:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:49:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525867225] [2025-03-17 05:49:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525867225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30459998] [2025-03-17 05:49:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:31,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:31,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:31,082 INFO L87 Difference]: Start difference. First operand 291 states and 396 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:31,240 INFO L93 Difference]: Finished difference Result 558 states and 756 transitions. [2025-03-17 05:49:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:31,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2025-03-17 05:49:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:31,242 INFO L225 Difference]: With dead ends: 558 [2025-03-17 05:49:31,242 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 05:49:31,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:31,243 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 227 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:31,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 504 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 05:49:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2025-03-17 05:49:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.2964601769911503) internal successors, (293), 227 states have internal predecessors, (293), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:49:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2025-03-17 05:49:31,266 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 112 [2025-03-17 05:49:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:31,266 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2025-03-17 05:49:31,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2025-03-17 05:49:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:49:31,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:31,267 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:31,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:49:31,268 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:31,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1161660824, now seen corresponding path program 1 times [2025-03-17 05:49:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718993231] [2025-03-17 05:49:31,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:49:31,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:49:31,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:31,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:31,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718993231] [2025-03-17 05:49:31,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718993231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091799882] [2025-03-17 05:49:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:31,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:31,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:31,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:31,629 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:31,758 INFO L93 Difference]: Finished difference Result 297 states and 395 transitions. [2025-03-17 05:49:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:49:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:31,761 INFO L225 Difference]: With dead ends: 297 [2025-03-17 05:49:31,761 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 05:49:31,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:31,762 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 68 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:31,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 550 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 05:49:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 274. [2025-03-17 05:49:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 236 states have internal predecessors, (302), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:49:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 366 transitions. [2025-03-17 05:49:31,786 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 366 transitions. Word has length 113 [2025-03-17 05:49:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:31,786 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 366 transitions. [2025-03-17 05:49:31,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 366 transitions. [2025-03-17 05:49:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:49:31,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:31,787 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:49:31,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1162584345, now seen corresponding path program 1 times [2025-03-17 05:49:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681357467] [2025-03-17 05:49:31,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:49:31,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:49:31,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:31,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:32,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681357467] [2025-03-17 05:49:32,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681357467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:49:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310997798] [2025-03-17 05:49:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:32,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:49:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:32,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:49:32,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:49:32,398 INFO L87 Difference]: Start difference. First operand 274 states and 366 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:33,274 INFO L93 Difference]: Finished difference Result 693 states and 917 transitions. [2025-03-17 05:49:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:49:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-17 05:49:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:33,276 INFO L225 Difference]: With dead ends: 693 [2025-03-17 05:49:33,276 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 05:49:33,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:49:33,278 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 388 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:33,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1239 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:49:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 05:49:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 400. [2025-03-17 05:49:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 332 states have (on average 1.2620481927710843) internal successors, (419), 335 states have internal predecessors, (419), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:49:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 531 transitions. [2025-03-17 05:49:33,313 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 531 transitions. Word has length 113 [2025-03-17 05:49:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 531 transitions. [2025-03-17 05:49:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 531 transitions. [2025-03-17 05:49:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:49:33,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:33,315 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:33,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:49:33,315 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:33,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2050088026, now seen corresponding path program 1 times [2025-03-17 05:49:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937379021] [2025-03-17 05:49:33,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:33,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:49:33,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:49:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937379021] [2025-03-17 05:49:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937379021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:33,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:49:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5480438] [2025-03-17 05:49:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:33,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:33,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:33,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:33,547 INFO L87 Difference]: Start difference. First operand 400 states and 531 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:33,640 INFO L93 Difference]: Finished difference Result 767 states and 1014 transitions. [2025-03-17 05:49:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:49:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:49:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:33,643 INFO L225 Difference]: With dead ends: 767 [2025-03-17 05:49:33,643 INFO L226 Difference]: Without dead ends: 567 [2025-03-17 05:49:33,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:33,644 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:33,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 546 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-17 05:49:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 499. [2025-03-17 05:49:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 431 states have (on average 1.2645011600928073) internal successors, (545), 434 states have internal predecessors, (545), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:49:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 657 transitions. [2025-03-17 05:49:33,679 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 657 transitions. Word has length 113 [2025-03-17 05:49:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:33,679 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 657 transitions. [2025-03-17 05:49:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 657 transitions. [2025-03-17 05:49:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:49:33,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:33,680 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:49:33,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:33,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1696632041, now seen corresponding path program 1 times [2025-03-17 05:49:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795780217] [2025-03-17 05:49:33,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:33,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:49:33,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:49:33,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:33,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795780217] [2025-03-17 05:49:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795780217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:49:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406110255] [2025-03-17 05:49:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:34,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:49:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:34,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:49:34,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:34,148 INFO L87 Difference]: Start difference. First operand 499 states and 657 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:34,926 INFO L93 Difference]: Finished difference Result 864 states and 1130 transitions. [2025-03-17 05:49:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-03-17 05:49:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:34,929 INFO L225 Difference]: With dead ends: 864 [2025-03-17 05:49:34,930 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 05:49:34,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:49:34,931 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 435 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:34,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 987 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:49:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 05:49:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 507. [2025-03-17 05:49:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 436 states have (on average 1.2522935779816513) internal successors, (546), 439 states have internal predecessors, (546), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:49:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2025-03-17 05:49:34,988 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 114 [2025-03-17 05:49:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2025-03-17 05:49:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2025-03-17 05:49:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:49:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:34,991 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:34,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:49:34,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash -481726382, now seen corresponding path program 1 times [2025-03-17 05:49:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686520274] [2025-03-17 05:49:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:35,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:49:35,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:49:35,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686520274] [2025-03-17 05:49:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686520274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:35,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804190356] [2025-03-17 05:49:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:35,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:35,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:35,282 INFO L87 Difference]: Start difference. First operand 507 states and 662 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:35,614 INFO L93 Difference]: Finished difference Result 790 states and 1029 transitions. [2025-03-17 05:49:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-17 05:49:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:35,617 INFO L225 Difference]: With dead ends: 790 [2025-03-17 05:49:35,617 INFO L226 Difference]: Without dead ends: 502 [2025-03-17 05:49:35,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:35,619 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 201 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:35,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 635 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-17 05:49:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 483. [2025-03-17 05:49:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 412 states have (on average 1.2378640776699028) internal successors, (510), 415 states have internal predecessors, (510), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:49:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 626 transitions. [2025-03-17 05:49:35,653 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 626 transitions. Word has length 114 [2025-03-17 05:49:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:35,653 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 626 transitions. [2025-03-17 05:49:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 626 transitions. [2025-03-17 05:49:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:49:35,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:35,655 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:35,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:49:35,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:35,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 572937079, now seen corresponding path program 1 times [2025-03-17 05:49:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91960623] [2025-03-17 05:49:35,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:49:35,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:49:35,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:35,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91960623] [2025-03-17 05:49:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91960623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:35,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934492734] [2025-03-17 05:49:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:36,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:36,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:36,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:36,000 INFO L87 Difference]: Start difference. First operand 483 states and 626 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:36,222 INFO L93 Difference]: Finished difference Result 842 states and 1085 transitions. [2025-03-17 05:49:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-17 05:49:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:36,227 INFO L225 Difference]: With dead ends: 842 [2025-03-17 05:49:36,227 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 05:49:36,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:36,230 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 166 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:36,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 482 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 05:49:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 576. [2025-03-17 05:49:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 494 states have (on average 1.2246963562753037) internal successors, (605), 500 states have internal predecessors, (605), 64 states have call successors, (64), 17 states have call predecessors, (64), 17 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:49:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 733 transitions. [2025-03-17 05:49:36,275 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 733 transitions. Word has length 115 [2025-03-17 05:49:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:36,275 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 733 transitions. [2025-03-17 05:49:36,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 733 transitions. [2025-03-17 05:49:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:49:36,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:36,276 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:36,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:49:36,276 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 89487134, now seen corresponding path program 1 times [2025-03-17 05:49:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125533530] [2025-03-17 05:49:36,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:36,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:49:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:49:36,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:36,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125533530] [2025-03-17 05:49:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125533530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644689544] [2025-03-17 05:49:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:36,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:36,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:36,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:36,662 INFO L87 Difference]: Start difference. First operand 576 states and 733 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:49:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:37,225 INFO L93 Difference]: Finished difference Result 1204 states and 1527 transitions. [2025-03-17 05:49:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:49:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-17 05:49:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:37,229 INFO L225 Difference]: With dead ends: 1204 [2025-03-17 05:49:37,229 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 05:49:37,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:49:37,231 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 179 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:37,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1158 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 05:49:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 592. [2025-03-17 05:49:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 510 states have (on average 1.2215686274509805) internal successors, (623), 516 states have internal predecessors, (623), 64 states have call successors, (64), 17 states have call predecessors, (64), 17 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:49:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 751 transitions. [2025-03-17 05:49:37,293 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 751 transitions. Word has length 115 [2025-03-17 05:49:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:37,293 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 751 transitions. [2025-03-17 05:49:37,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:49:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 751 transitions. [2025-03-17 05:49:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:49:37,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:37,295 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:37,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:49:37,295 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1707464225, now seen corresponding path program 1 times [2025-03-17 05:49:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523413783] [2025-03-17 05:49:37,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:49:37,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:49:37,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:37,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523413783] [2025-03-17 05:49:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523413783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048100187] [2025-03-17 05:49:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:37,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:37,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:37,560 INFO L87 Difference]: Start difference. First operand 592 states and 751 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:37,788 INFO L93 Difference]: Finished difference Result 1375 states and 1743 transitions. [2025-03-17 05:49:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-17 05:49:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:37,791 INFO L225 Difference]: With dead ends: 1375 [2025-03-17 05:49:37,791 INFO L226 Difference]: Without dead ends: 828 [2025-03-17 05:49:37,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:37,793 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 320 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:37,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 682 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-17 05:49:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 726. [2025-03-17 05:49:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 644 states have (on average 1.2298136645962734) internal successors, (792), 649 states have internal predecessors, (792), 64 states have call successors, (64), 17 states have call predecessors, (64), 17 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:49:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 920 transitions. [2025-03-17 05:49:37,858 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 920 transitions. Word has length 115 [2025-03-17 05:49:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:37,858 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 920 transitions. [2025-03-17 05:49:37,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 920 transitions. [2025-03-17 05:49:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:49:37,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:37,859 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:37,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:49:37,860 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:37,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1334251615, now seen corresponding path program 1 times [2025-03-17 05:49:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937859747] [2025-03-17 05:49:37,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:37,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:49:37,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:49:37,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:37,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937859747] [2025-03-17 05:49:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937859747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987170879] [2025-03-17 05:49:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:38,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:38,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:38,073 INFO L87 Difference]: Start difference. First operand 726 states and 920 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:38,266 INFO L93 Difference]: Finished difference Result 1420 states and 1786 transitions. [2025-03-17 05:49:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:49:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-17 05:49:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:38,270 INFO L225 Difference]: With dead ends: 1420 [2025-03-17 05:49:38,270 INFO L226 Difference]: Without dead ends: 816 [2025-03-17 05:49:38,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:38,272 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 164 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:38,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 545 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-17 05:49:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 724. [2025-03-17 05:49:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 642 states have (on average 1.222741433021807) internal successors, (785), 647 states have internal predecessors, (785), 64 states have call successors, (64), 17 states have call predecessors, (64), 17 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:49:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 913 transitions. [2025-03-17 05:49:38,324 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 913 transitions. Word has length 115 [2025-03-17 05:49:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:38,324 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 913 transitions. [2025-03-17 05:49:38,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 913 transitions. [2025-03-17 05:49:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:49:38,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:38,325 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:49:38,326 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -699093104, now seen corresponding path program 1 times [2025-03-17 05:49:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913338356] [2025-03-17 05:49:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:49:38,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:49:38,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:38,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913338356] [2025-03-17 05:49:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913338356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364754516] [2025-03-17 05:49:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:38,771 INFO L87 Difference]: Start difference. First operand 724 states and 913 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:39,154 INFO L93 Difference]: Finished difference Result 1036 states and 1305 transitions. [2025-03-17 05:49:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-17 05:49:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:39,157 INFO L225 Difference]: With dead ends: 1036 [2025-03-17 05:49:39,157 INFO L226 Difference]: Without dead ends: 704 [2025-03-17 05:49:39,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:39,158 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 283 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:39,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 519 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-17 05:49:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 611. [2025-03-17 05:49:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 535 states have (on average 1.2112149532710281) internal successors, (648), 537 states have internal predecessors, (648), 58 states have call successors, (58), 17 states have call predecessors, (58), 17 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:49:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 764 transitions. [2025-03-17 05:49:39,201 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 764 transitions. Word has length 116 [2025-03-17 05:49:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:39,202 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 764 transitions. [2025-03-17 05:49:39,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 764 transitions. [2025-03-17 05:49:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:49:39,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:39,202 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:49:39,202 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:39,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1995454295, now seen corresponding path program 1 times [2025-03-17 05:49:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616909977] [2025-03-17 05:49:39,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:39,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:49:39,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:49:39,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:39,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:40,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616909977] [2025-03-17 05:49:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616909977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 05:49:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530240615] [2025-03-17 05:49:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:40,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:49:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:40,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:49:40,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:49:40,157 INFO L87 Difference]: Start difference. First operand 611 states and 764 transitions. Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:40,901 INFO L93 Difference]: Finished difference Result 1081 states and 1364 transitions. [2025-03-17 05:49:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:49:40,901 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 117 [2025-03-17 05:49:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:40,904 INFO L225 Difference]: With dead ends: 1081 [2025-03-17 05:49:40,904 INFO L226 Difference]: Without dead ends: 856 [2025-03-17 05:49:40,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:49:40,906 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 178 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:40,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1579 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-17 05:49:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 832. [2025-03-17 05:49:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 745 states have (on average 1.2281879194630871) internal successors, (915), 748 states have internal predecessors, (915), 66 states have call successors, (66), 20 states have call predecessors, (66), 20 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1047 transitions. [2025-03-17 05:49:40,960 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1047 transitions. Word has length 117 [2025-03-17 05:49:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:40,960 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1047 transitions. [2025-03-17 05:49:40,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1047 transitions. [2025-03-17 05:49:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:49:40,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:40,961 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:40,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:49:40,962 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:40,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash -268040365, now seen corresponding path program 1 times [2025-03-17 05:49:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222414249] [2025-03-17 05:49:40,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:49:40,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:49:40,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222414249] [2025-03-17 05:49:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222414249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549652735] [2025-03-17 05:49:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:41,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:41,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:41,201 INFO L87 Difference]: Start difference. First operand 832 states and 1047 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:41,411 INFO L93 Difference]: Finished difference Result 1675 states and 2109 transitions. [2025-03-17 05:49:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-17 05:49:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:41,415 INFO L225 Difference]: With dead ends: 1675 [2025-03-17 05:49:41,415 INFO L226 Difference]: Without dead ends: 1296 [2025-03-17 05:49:41,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:49:41,417 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 97 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:41,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1022 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-03-17 05:49:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 980. [2025-03-17 05:49:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 893 states have (on average 1.2340425531914894) internal successors, (1102), 896 states have internal predecessors, (1102), 66 states have call successors, (66), 20 states have call predecessors, (66), 20 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1234 transitions. [2025-03-17 05:49:41,481 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1234 transitions. Word has length 118 [2025-03-17 05:49:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1234 transitions. [2025-03-17 05:49:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1234 transitions. [2025-03-17 05:49:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:41,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:41,483 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:49:41,483 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1436322132, now seen corresponding path program 1 times [2025-03-17 05:49:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53665548] [2025-03-17 05:49:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:41,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53665548] [2025-03-17 05:49:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53665548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452095380] [2025-03-17 05:49:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:41,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:41,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:41,855 INFO L87 Difference]: Start difference. First operand 980 states and 1234 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:42,278 INFO L93 Difference]: Finished difference Result 1726 states and 2198 transitions. [2025-03-17 05:49:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-17 05:49:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:42,284 INFO L225 Difference]: With dead ends: 1726 [2025-03-17 05:49:42,284 INFO L226 Difference]: Without dead ends: 1262 [2025-03-17 05:49:42,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:42,286 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:42,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 824 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-03-17 05:49:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1097. [2025-03-17 05:49:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1010 states have (on average 1.2485148514851485) internal successors, (1261), 1013 states have internal predecessors, (1261), 66 states have call successors, (66), 20 states have call predecessors, (66), 20 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1393 transitions. [2025-03-17 05:49:42,351 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1393 transitions. Word has length 119 [2025-03-17 05:49:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:42,353 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1393 transitions. [2025-03-17 05:49:42,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1393 transitions. [2025-03-17 05:49:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:42,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:42,354 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:42,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:49:42,354 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:42,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1505335467, now seen corresponding path program 1 times [2025-03-17 05:49:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20766515] [2025-03-17 05:49:42,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:42,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:42,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:42,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20766515] [2025-03-17 05:49:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20766515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963369066] [2025-03-17 05:49:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:42,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:42,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:42,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:42,837 INFO L87 Difference]: Start difference. First operand 1097 states and 1393 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:43,212 INFO L93 Difference]: Finished difference Result 1748 states and 2222 transitions. [2025-03-17 05:49:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-17 05:49:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:43,216 INFO L225 Difference]: With dead ends: 1748 [2025-03-17 05:49:43,216 INFO L226 Difference]: Without dead ends: 1237 [2025-03-17 05:49:43,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:43,219 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 243 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:43,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 766 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-17 05:49:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1101. [2025-03-17 05:49:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1013 states have (on average 1.2477788746298124) internal successors, (1264), 1016 states have internal predecessors, (1264), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1396 transitions. [2025-03-17 05:49:43,296 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1396 transitions. Word has length 119 [2025-03-17 05:49:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:43,296 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1396 transitions. [2025-03-17 05:49:43,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1396 transitions. [2025-03-17 05:49:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:43,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:43,297 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:49:43,298 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2131800556, now seen corresponding path program 1 times [2025-03-17 05:49:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974488571] [2025-03-17 05:49:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:43,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:43,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974488571] [2025-03-17 05:49:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974488571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:49:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104031186] [2025-03-17 05:49:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:49:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:49:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:43,856 INFO L87 Difference]: Start difference. First operand 1101 states and 1396 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:44,390 INFO L93 Difference]: Finished difference Result 1875 states and 2404 transitions. [2025-03-17 05:49:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:49:44,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 119 [2025-03-17 05:49:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:44,394 INFO L225 Difference]: With dead ends: 1875 [2025-03-17 05:49:44,394 INFO L226 Difference]: Without dead ends: 1372 [2025-03-17 05:49:44,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:44,396 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 245 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:44,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 976 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-17 05:49:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1221. [2025-03-17 05:49:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1133 states have (on average 1.2586054721977051) internal successors, (1426), 1136 states have internal predecessors, (1426), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1558 transitions. [2025-03-17 05:49:44,477 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1558 transitions. Word has length 119 [2025-03-17 05:49:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1558 transitions. [2025-03-17 05:49:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1558 transitions. [2025-03-17 05:49:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:44,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:44,479 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:49:44,479 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:44,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash -624248747, now seen corresponding path program 1 times [2025-03-17 05:49:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878076925] [2025-03-17 05:49:44,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:44,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:44,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:44,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:44,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:44,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878076925] [2025-03-17 05:49:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878076925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:44,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:44,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751864438] [2025-03-17 05:49:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:44,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:44,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:44,729 INFO L87 Difference]: Start difference. First operand 1221 states and 1558 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:45,038 INFO L93 Difference]: Finished difference Result 2092 states and 2661 transitions. [2025-03-17 05:49:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-17 05:49:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:45,051 INFO L225 Difference]: With dead ends: 2092 [2025-03-17 05:49:45,052 INFO L226 Difference]: Without dead ends: 1484 [2025-03-17 05:49:45,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:45,053 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 236 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:45,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 602 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-03-17 05:49:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1221. [2025-03-17 05:49:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1133 states have (on average 1.2462488967343337) internal successors, (1412), 1136 states have internal predecessors, (1412), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1544 transitions. [2025-03-17 05:49:45,133 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1544 transitions. Word has length 119 [2025-03-17 05:49:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:45,134 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1544 transitions. [2025-03-17 05:49:45,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1544 transitions. [2025-03-17 05:49:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:45,135 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:49:45,136 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1787122069, now seen corresponding path program 1 times [2025-03-17 05:49:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:45,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997056885] [2025-03-17 05:49:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:45,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:45,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:45,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:45,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997056885] [2025-03-17 05:49:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997056885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:49:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974805973] [2025-03-17 05:49:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:49:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:49:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:45,410 INFO L87 Difference]: Start difference. First operand 1221 states and 1544 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:45,938 INFO L93 Difference]: Finished difference Result 2073 states and 2617 transitions. [2025-03-17 05:49:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:49:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 05:49:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:45,948 INFO L225 Difference]: With dead ends: 2073 [2025-03-17 05:49:45,948 INFO L226 Difference]: Without dead ends: 1437 [2025-03-17 05:49:45,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:49:45,950 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 274 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:45,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 942 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-17 05:49:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1221. [2025-03-17 05:49:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1133 states have (on average 1.2391879964695498) internal successors, (1404), 1136 states have internal predecessors, (1404), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1536 transitions. [2025-03-17 05:49:46,021 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1536 transitions. Word has length 119 [2025-03-17 05:49:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:46,021 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1536 transitions. [2025-03-17 05:49:46,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1536 transitions. [2025-03-17 05:49:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:46,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:46,022 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:49:46,022 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1154535530, now seen corresponding path program 1 times [2025-03-17 05:49:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455409428] [2025-03-17 05:49:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:46,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:46,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:46,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455409428] [2025-03-17 05:49:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455409428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:46,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:49:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680709381] [2025-03-17 05:49:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:46,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:49:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:46,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:49:46,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:49:46,396 INFO L87 Difference]: Start difference. First operand 1221 states and 1536 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:46,794 INFO L93 Difference]: Finished difference Result 1884 states and 2380 transitions. [2025-03-17 05:49:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-17 05:49:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:46,798 INFO L225 Difference]: With dead ends: 1884 [2025-03-17 05:49:46,798 INFO L226 Difference]: Without dead ends: 1325 [2025-03-17 05:49:46,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:49:46,800 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 230 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:46,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 817 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-17 05:49:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1189. [2025-03-17 05:49:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1101 states have (on average 1.2352406902815622) internal successors, (1360), 1104 states have internal predecessors, (1360), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1492 transitions. [2025-03-17 05:49:46,868 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1492 transitions. Word has length 119 [2025-03-17 05:49:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1492 transitions. [2025-03-17 05:49:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 05:49:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1492 transitions. [2025-03-17 05:49:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:46,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:46,869 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:46,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:49:46,870 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:46,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash -273448810, now seen corresponding path program 1 times [2025-03-17 05:49:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910668834] [2025-03-17 05:49:46,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:46,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:46,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:46,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910668834] [2025-03-17 05:49:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910668834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:47,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:47,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609821347] [2025-03-17 05:49:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:47,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:47,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:47,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:47,107 INFO L87 Difference]: Start difference. First operand 1189 states and 1492 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:47,396 INFO L93 Difference]: Finished difference Result 2106 states and 2651 transitions. [2025-03-17 05:49:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:47,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-17 05:49:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:47,403 INFO L225 Difference]: With dead ends: 2106 [2025-03-17 05:49:47,403 INFO L226 Difference]: Without dead ends: 1465 [2025-03-17 05:49:47,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:47,405 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 164 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:47,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 535 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-03-17 05:49:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1189. [2025-03-17 05:49:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1101 states have (on average 1.2325158946412353) internal successors, (1357), 1104 states have internal predecessors, (1357), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1489 transitions. [2025-03-17 05:49:47,479 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1489 transitions. Word has length 119 [2025-03-17 05:49:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1489 transitions. [2025-03-17 05:49:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1489 transitions. [2025-03-17 05:49:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:49:47,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:47,480 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:49:47,480 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:47,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 419652887, now seen corresponding path program 1 times [2025-03-17 05:49:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:47,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223133812] [2025-03-17 05:49:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:49:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:49:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223133812] [2025-03-17 05:49:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223133812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:49:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961986597] [2025-03-17 05:49:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:49:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:48,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:49:48,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:48,341 INFO L87 Difference]: Start difference. First operand 1189 states and 1489 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:49,116 INFO L93 Difference]: Finished difference Result 1841 states and 2316 transitions. [2025-03-17 05:49:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:49:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 119 [2025-03-17 05:49:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:49,120 INFO L225 Difference]: With dead ends: 1841 [2025-03-17 05:49:49,120 INFO L226 Difference]: Without dead ends: 1290 [2025-03-17 05:49:49,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:49:49,122 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 319 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:49,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1427 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-17 05:49:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1185. [2025-03-17 05:49:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1097 states have (on average 1.2297174111212397) internal successors, (1349), 1100 states have internal predecessors, (1349), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1481 transitions. [2025-03-17 05:49:49,182 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1481 transitions. Word has length 119 [2025-03-17 05:49:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1481 transitions. [2025-03-17 05:49:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-17 05:49:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1481 transitions. [2025-03-17 05:49:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:49:49,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:49,183 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:49:49,183 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -600775471, now seen corresponding path program 1 times [2025-03-17 05:49:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280721132] [2025-03-17 05:49:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:49,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:49:49,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:49:49,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:49,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280721132] [2025-03-17 05:49:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280721132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:49,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:49,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:49:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652639535] [2025-03-17 05:49:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:49,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:49:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:49,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:49:49,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:49,519 INFO L87 Difference]: Start difference. First operand 1185 states and 1481 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:49,816 INFO L93 Difference]: Finished difference Result 2025 states and 2547 transitions. [2025-03-17 05:49:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:49:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-17 05:49:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:49,828 INFO L225 Difference]: With dead ends: 2025 [2025-03-17 05:49:49,828 INFO L226 Difference]: Without dead ends: 1515 [2025-03-17 05:49:49,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:49:49,831 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 77 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:49,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1124 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-03-17 05:49:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1333. [2025-03-17 05:49:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1245 states have (on average 1.23855421686747) internal successors, (1542), 1248 states have internal predecessors, (1542), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1674 transitions. [2025-03-17 05:49:49,915 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1674 transitions. Word has length 121 [2025-03-17 05:49:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:49,915 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1674 transitions. [2025-03-17 05:49:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1674 transitions. [2025-03-17 05:49:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:49:49,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:49,917 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:49:49,917 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:49,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 906776338, now seen corresponding path program 1 times [2025-03-17 05:49:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655345867] [2025-03-17 05:49:49,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:49,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:49:49,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:49:49,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655345867] [2025-03-17 05:49:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655345867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10995475] [2025-03-17 05:49:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:50,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:50,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:50,245 INFO L87 Difference]: Start difference. First operand 1333 states and 1674 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:50,418 INFO L93 Difference]: Finished difference Result 2236 states and 2816 transitions. [2025-03-17 05:49:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-17 05:49:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:50,424 INFO L225 Difference]: With dead ends: 2236 [2025-03-17 05:49:50,424 INFO L226 Difference]: Without dead ends: 1619 [2025-03-17 05:49:50,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:50,426 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:50,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 536 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:49:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-03-17 05:49:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1347. [2025-03-17 05:49:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1259 states have (on average 1.232724384432089) internal successors, (1552), 1262 states have internal predecessors, (1552), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1684 transitions. [2025-03-17 05:49:50,490 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1684 transitions. Word has length 121 [2025-03-17 05:49:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1684 transitions. [2025-03-17 05:49:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1684 transitions. [2025-03-17 05:49:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:49:50,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:50,491 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:49:50,492 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash -249975534, now seen corresponding path program 1 times [2025-03-17 05:49:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:50,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780603744] [2025-03-17 05:49:50,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:50,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:49:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:49:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780603744] [2025-03-17 05:49:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780603744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:49:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616465481] [2025-03-17 05:49:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:49:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:49:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:50,899 INFO L87 Difference]: Start difference. First operand 1347 states and 1684 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:51,508 INFO L93 Difference]: Finished difference Result 2001 states and 2520 transitions. [2025-03-17 05:49:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:49:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-17 05:49:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:51,515 INFO L225 Difference]: With dead ends: 2001 [2025-03-17 05:49:51,518 INFO L226 Difference]: Without dead ends: 1384 [2025-03-17 05:49:51,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:49:51,520 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 278 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:51,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1115 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:49:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-17 05:49:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1317. [2025-03-17 05:49:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1229 states have (on average 1.2286411716842962) internal successors, (1510), 1232 states have internal predecessors, (1510), 66 states have call successors, (66), 21 states have call predecessors, (66), 21 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1642 transitions. [2025-03-17 05:49:51,632 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1642 transitions. Word has length 121 [2025-03-17 05:49:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1642 transitions. [2025-03-17 05:49:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1642 transitions. [2025-03-17 05:49:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:49:51,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:51,634 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:49:51,634 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:51,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1089104811, now seen corresponding path program 1 times [2025-03-17 05:49:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224958079] [2025-03-17 05:49:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:51,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:49:51,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:49:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224958079] [2025-03-17 05:49:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224958079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:49:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99993794] [2025-03-17 05:49:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:51,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:51,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:51,824 INFO L87 Difference]: Start difference. First operand 1317 states and 1642 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:51,947 INFO L93 Difference]: Finished difference Result 2076 states and 2572 transitions. [2025-03-17 05:49:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-17 05:49:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:51,950 INFO L225 Difference]: With dead ends: 2076 [2025-03-17 05:49:51,950 INFO L226 Difference]: Without dead ends: 1216 [2025-03-17 05:49:51,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:51,952 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 126 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:51,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 529 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-17 05:49:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1165. [2025-03-17 05:49:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1076 states have (on average 1.1840148698884758) internal successors, (1274), 1079 states have internal predecessors, (1274), 66 states have call successors, (66), 22 states have call predecessors, (66), 22 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:49:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1406 transitions. [2025-03-17 05:49:52,017 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1406 transitions. Word has length 123 [2025-03-17 05:49:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:52,017 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1406 transitions. [2025-03-17 05:49:52,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1406 transitions. [2025-03-17 05:49:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:49:52,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:52,018 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:49:52,018 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:52,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1058085004, now seen corresponding path program 1 times [2025-03-17 05:49:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490714861] [2025-03-17 05:49:52,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:52,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:49:52,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:49:52,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:52,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490714861] [2025-03-17 05:49:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490714861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:49:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170706747] [2025-03-17 05:49:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:52,345 INFO L87 Difference]: Start difference. First operand 1165 states and 1406 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:52,733 INFO L93 Difference]: Finished difference Result 1866 states and 2262 transitions. [2025-03-17 05:49:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:49:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-17 05:49:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:52,737 INFO L225 Difference]: With dead ends: 1866 [2025-03-17 05:49:52,737 INFO L226 Difference]: Without dead ends: 1266 [2025-03-17 05:49:52,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:49:52,740 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 248 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 572 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:49:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-03-17 05:49:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1157. [2025-03-17 05:49:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1059 states have (on average 1.1803588290840414) internal successors, (1250), 1063 states have internal predecessors, (1250), 72 states have call successors, (72), 25 states have call predecessors, (72), 25 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:49:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1394 transitions. [2025-03-17 05:49:52,819 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1394 transitions. Word has length 123 [2025-03-17 05:49:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:52,820 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1394 transitions. [2025-03-17 05:49:52,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1394 transitions. [2025-03-17 05:49:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:49:52,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:52,821 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:52,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 05:49:52,821 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2020705590, now seen corresponding path program 1 times [2025-03-17 05:49:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496638767] [2025-03-17 05:49:52,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:52,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:49:52,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:49:52,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:52,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496638767] [2025-03-17 05:49:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496638767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:49:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830277469] [2025-03-17 05:49:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:49:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:49:53,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:49:53,135 INFO L87 Difference]: Start difference. First operand 1157 states and 1394 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:53,634 INFO L93 Difference]: Finished difference Result 1916 states and 2310 transitions. [2025-03-17 05:49:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-17 05:49:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:53,637 INFO L225 Difference]: With dead ends: 1916 [2025-03-17 05:49:53,637 INFO L226 Difference]: Without dead ends: 1352 [2025-03-17 05:49:53,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:53,638 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 344 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:53,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1099 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-17 05:49:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1159. [2025-03-17 05:49:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1061 states have (on average 1.17813383600377) internal successors, (1250), 1065 states have internal predecessors, (1250), 72 states have call successors, (72), 25 states have call predecessors, (72), 25 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:49:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1394 transitions. [2025-03-17 05:49:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1394 transitions. Word has length 123 [2025-03-17 05:49:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:53,715 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1394 transitions. [2025-03-17 05:49:53,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:49:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1394 transitions. [2025-03-17 05:49:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:49:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:53,716 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:53,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 05:49:53,716 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -766709897, now seen corresponding path program 1 times [2025-03-17 05:49:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325285710] [2025-03-17 05:49:53,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:49:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:49:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:49:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325285710] [2025-03-17 05:49:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325285710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 05:49:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213046289] [2025-03-17 05:49:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:49:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:54,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:49:54,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:49:54,474 INFO L87 Difference]: Start difference. First operand 1159 states and 1394 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:55,988 INFO L93 Difference]: Finished difference Result 1796 states and 2167 transitions. [2025-03-17 05:49:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 05:49:55,988 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-17 05:49:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:55,991 INFO L225 Difference]: With dead ends: 1796 [2025-03-17 05:49:55,991 INFO L226 Difference]: Without dead ends: 1258 [2025-03-17 05:49:55,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1833, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 05:49:55,992 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 317 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:55,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 2191 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:49:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-17 05:49:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1145. [2025-03-17 05:49:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1047 states have (on average 1.1786055396370583) internal successors, (1234), 1051 states have internal predecessors, (1234), 72 states have call successors, (72), 25 states have call predecessors, (72), 25 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:49:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1378 transitions. [2025-03-17 05:49:56,072 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1378 transitions. Word has length 123 [2025-03-17 05:49:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1378 transitions. [2025-03-17 05:49:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:49:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1378 transitions. [2025-03-17 05:49:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-17 05:49:56,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:56,079 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:56,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 05:49:56,079 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:56,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 236351872, now seen corresponding path program 1 times [2025-03-17 05:49:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513446012] [2025-03-17 05:49:56,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 05:49:56,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 05:49:56,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:56,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 05:49:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:49:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513446012] [2025-03-17 05:49:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513446012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339682893] [2025-03-17 05:49:57,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:49:57,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:57,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:49:57,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:49:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 05:49:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 05:49:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:57,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:49:57,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:57,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:49:58,169 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 17 treesize of output 9 [2025-03-17 05:49:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 58 proven. 785 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-17 05:49:58,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:58,421 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 32 treesize of output 28 [2025-03-17 05:49:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2025-03-17 05:49:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339682893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:49:58,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:49:58,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2025-03-17 05:49:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556816008] [2025-03-17 05:49:58,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:49:58,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 05:49:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:49:58,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 05:49:58,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:49:58,589 INFO L87 Difference]: Start difference. First operand 1145 states and 1378 transitions. Second operand has 30 states, 27 states have (on average 7.444444444444445) internal successors, (201), 28 states have internal predecessors, (201), 9 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 8 states have call predecessors, (80), 9 states have call successors, (80) [2025-03-17 05:50:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:01,554 INFO L93 Difference]: Finished difference Result 2014 states and 2412 transitions. [2025-03-17 05:50:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 05:50:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 7.444444444444445) internal successors, (201), 28 states have internal predecessors, (201), 9 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 8 states have call predecessors, (80), 9 states have call successors, (80) Word has length 222 [2025-03-17 05:50:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:01,558 INFO L225 Difference]: With dead ends: 2014 [2025-03-17 05:50:01,558 INFO L226 Difference]: Without dead ends: 1319 [2025-03-17 05:50:01,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=956, Invalid=4446, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 05:50:01,560 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 645 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:01,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1655 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:50:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-17 05:50:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 937. [2025-03-17 05:50:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 847 states have (on average 1.155844155844156) internal successors, (979), 850 states have internal predecessors, (979), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1099 transitions. [2025-03-17 05:50:01,663 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1099 transitions. Word has length 222 [2025-03-17 05:50:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:01,664 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1099 transitions. [2025-03-17 05:50:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 7.444444444444445) internal successors, (201), 28 states have internal predecessors, (201), 9 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 8 states have call predecessors, (80), 9 states have call successors, (80) [2025-03-17 05:50:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1099 transitions. [2025-03-17 05:50:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 05:50:01,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:01,665 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:01,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:50:01,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:01,866 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2003165871, now seen corresponding path program 1 times [2025-03-17 05:50:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:01,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113765702] [2025-03-17 05:50:01,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 05:50:01,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 05:50:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:02,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113765702] [2025-03-17 05:50:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113765702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:02,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:50:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148905553] [2025-03-17 05:50:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:50:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:02,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:50:02,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:02,213 INFO L87 Difference]: Start difference. First operand 937 states and 1099 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:02,411 INFO L93 Difference]: Finished difference Result 1800 states and 2111 transitions. [2025-03-17 05:50:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:50:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-03-17 05:50:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:02,413 INFO L225 Difference]: With dead ends: 1800 [2025-03-17 05:50:02,413 INFO L226 Difference]: Without dead ends: 1071 [2025-03-17 05:50:02,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:02,419 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 198 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 384 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-17 05:50:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 963. [2025-03-17 05:50:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 873 states have (on average 1.15922107674685) internal successors, (1012), 876 states have internal predecessors, (1012), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1132 transitions. [2025-03-17 05:50:02,532 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1132 transitions. Word has length 229 [2025-03-17 05:50:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1132 transitions. [2025-03-17 05:50:02,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1132 transitions. [2025-03-17 05:50:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 05:50:02,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:02,535 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 05:50:02,535 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:02,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1038549969, now seen corresponding path program 1 times [2025-03-17 05:50:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137112184] [2025-03-17 05:50:02,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:02,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 05:50:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 05:50:02,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137112184] [2025-03-17 05:50:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137112184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:50:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009237655] [2025-03-17 05:50:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:02,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:50:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:02,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:50:02,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:50:02,946 INFO L87 Difference]: Start difference. First operand 963 states and 1132 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:03,406 INFO L93 Difference]: Finished difference Result 1799 states and 2117 transitions. [2025-03-17 05:50:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:03,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-03-17 05:50:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:03,409 INFO L225 Difference]: With dead ends: 1799 [2025-03-17 05:50:03,409 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 05:50:03,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:03,411 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 146 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:03,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 514 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 05:50:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 963. [2025-03-17 05:50:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 873 states have (on average 1.1557846506300113) internal successors, (1009), 876 states have internal predecessors, (1009), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1129 transitions. [2025-03-17 05:50:03,556 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1129 transitions. Word has length 229 [2025-03-17 05:50:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1129 transitions. [2025-03-17 05:50:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1129 transitions. [2025-03-17 05:50:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 05:50:03,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:03,558 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 05:50:03,558 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -758401390, now seen corresponding path program 1 times [2025-03-17 05:50:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832644495] [2025-03-17 05:50:03,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:03,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 05:50:03,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 05:50:03,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-17 05:50:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832644495] [2025-03-17 05:50:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832644495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:03,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:50:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837078987] [2025-03-17 05:50:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:03,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:50:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:03,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:50:03,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:03,943 INFO L87 Difference]: Start difference. First operand 963 states and 1129 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:04,147 INFO L93 Difference]: Finished difference Result 1980 states and 2332 transitions. [2025-03-17 05:50:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:50:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-03-17 05:50:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:04,150 INFO L225 Difference]: With dead ends: 1980 [2025-03-17 05:50:04,150 INFO L226 Difference]: Without dead ends: 1196 [2025-03-17 05:50:04,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:04,151 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 95 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:04,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1060 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-03-17 05:50:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 963. [2025-03-17 05:50:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 873 states have (on average 1.1557846506300113) internal successors, (1009), 876 states have internal predecessors, (1009), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1129 transitions. [2025-03-17 05:50:04,250 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1129 transitions. Word has length 229 [2025-03-17 05:50:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1129 transitions. [2025-03-17 05:50:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1129 transitions. [2025-03-17 05:50:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 05:50:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:04,252 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:04,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-17 05:50:04,252 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1167632688, now seen corresponding path program 1 times [2025-03-17 05:50:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274565671] [2025-03-17 05:50:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:04,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 05:50:04,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 05:50:04,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:04,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274565671] [2025-03-17 05:50:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274565671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185745692] [2025-03-17 05:50:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:04,453 INFO L87 Difference]: Start difference. First operand 963 states and 1129 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:04,661 INFO L93 Difference]: Finished difference Result 1799 states and 2111 transitions. [2025-03-17 05:50:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-03-17 05:50:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:04,663 INFO L225 Difference]: With dead ends: 1799 [2025-03-17 05:50:04,663 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 05:50:04,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:04,664 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 37 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:04,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 406 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 05:50:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 971. [2025-03-17 05:50:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 881 states have (on average 1.1498297389330308) internal successors, (1013), 884 states have internal predecessors, (1013), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1133 transitions. [2025-03-17 05:50:04,766 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1133 transitions. Word has length 229 [2025-03-17 05:50:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:04,766 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1133 transitions. [2025-03-17 05:50:04,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1133 transitions. [2025-03-17 05:50:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 05:50:04,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:04,767 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-17 05:50:04,768 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2070172624, now seen corresponding path program 1 times [2025-03-17 05:50:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508935797] [2025-03-17 05:50:04,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:04,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 05:50:04,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 05:50:04,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508935797] [2025-03-17 05:50:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508935797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:04,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423570872] [2025-03-17 05:50:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:04,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:04,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:04,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:04,936 INFO L87 Difference]: Start difference. First operand 971 states and 1133 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:05,077 INFO L93 Difference]: Finished difference Result 1754 states and 2050 transitions. [2025-03-17 05:50:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-03-17 05:50:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:05,079 INFO L225 Difference]: With dead ends: 1754 [2025-03-17 05:50:05,079 INFO L226 Difference]: Without dead ends: 966 [2025-03-17 05:50:05,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:05,080 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 44 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:05,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 407 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-17 05:50:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 934. [2025-03-17 05:50:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 844 states have (on average 1.1481042654028435) internal successors, (969), 847 states have internal predecessors, (969), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1089 transitions. [2025-03-17 05:50:05,180 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1089 transitions. Word has length 229 [2025-03-17 05:50:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1089 transitions. [2025-03-17 05:50:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1089 transitions. [2025-03-17 05:50:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 05:50:05,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:05,182 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:05,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 05:50:05,182 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:05,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash -618510896, now seen corresponding path program 1 times [2025-03-17 05:50:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284691284] [2025-03-17 05:50:05,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:05,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 05:50:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 05:50:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 05:50:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284691284] [2025-03-17 05:50:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284691284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157611950] [2025-03-17 05:50:06,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:06,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:06,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:06,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:06,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:50:06,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 05:50:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 05:50:06,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:06,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:50:06,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:07,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:07,081 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 15 treesize of output 11 [2025-03-17 05:50:07,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:07,152 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 36 treesize of output 24 [2025-03-17 05:50:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2025-03-17 05:50:07,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157611950] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:50:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15, 6] total 18 [2025-03-17 05:50:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471219868] [2025-03-17 05:50:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:50:07,335 INFO L87 Difference]: Start difference. First operand 934 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:07,515 INFO L93 Difference]: Finished difference Result 1484 states and 1744 transitions. [2025-03-17 05:50:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 231 [2025-03-17 05:50:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:07,517 INFO L225 Difference]: With dead ends: 1484 [2025-03-17 05:50:07,518 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 05:50:07,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 460 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:50:07,519 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:07,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 497 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 05:50:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 921. [2025-03-17 05:50:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 831 states have (on average 1.1371841155234657) internal successors, (945), 834 states have internal predecessors, (945), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1065 transitions. [2025-03-17 05:50:07,651 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1065 transitions. Word has length 231 [2025-03-17 05:50:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:07,651 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1065 transitions. [2025-03-17 05:50:07,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1065 transitions. [2025-03-17 05:50:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 05:50:07,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:07,654 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:07,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:50:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-17 05:50:07,854 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1593467116, now seen corresponding path program 1 times [2025-03-17 05:50:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260599787] [2025-03-17 05:50:07,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:07,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 05:50:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 05:50:08,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:08,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-17 05:50:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260599787] [2025-03-17 05:50:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260599787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:08,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350948297] [2025-03-17 05:50:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:08,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:08,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:08,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:08,424 INFO L87 Difference]: Start difference. First operand 921 states and 1065 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:08,573 INFO L93 Difference]: Finished difference Result 1406 states and 1632 transitions. [2025-03-17 05:50:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:50:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 231 [2025-03-17 05:50:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:08,576 INFO L225 Difference]: With dead ends: 1406 [2025-03-17 05:50:08,576 INFO L226 Difference]: Without dead ends: 872 [2025-03-17 05:50:08,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:08,577 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 41 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:08,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 476 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-17 05:50:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 867. [2025-03-17 05:50:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 777 states have (on average 1.1222651222651223) internal successors, (872), 780 states have internal predecessors, (872), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 992 transitions. [2025-03-17 05:50:08,675 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 992 transitions. Word has length 231 [2025-03-17 05:50:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 992 transitions. [2025-03-17 05:50:08,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 992 transitions. [2025-03-17 05:50:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-17 05:50:08,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:08,676 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 05:50:08,676 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:08,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1808988417, now seen corresponding path program 1 times [2025-03-17 05:50:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335445327] [2025-03-17 05:50:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:08,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-17 05:50:08,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-17 05:50:08,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:08,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2025-03-17 05:50:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:08,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335445327] [2025-03-17 05:50:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335445327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121212415] [2025-03-17 05:50:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:08,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:08,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:08,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:08,966 INFO L87 Difference]: Start difference. First operand 867 states and 992 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:09,123 INFO L93 Difference]: Finished difference Result 1419 states and 1625 transitions. [2025-03-17 05:50:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:50:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 232 [2025-03-17 05:50:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:09,126 INFO L225 Difference]: With dead ends: 1419 [2025-03-17 05:50:09,126 INFO L226 Difference]: Without dead ends: 943 [2025-03-17 05:50:09,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:09,127 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 39 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:09,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 497 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-17 05:50:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869. [2025-03-17 05:50:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 779 states have (on average 1.1206675224646983) internal successors, (873), 782 states have internal predecessors, (873), 60 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:50:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 993 transitions. [2025-03-17 05:50:09,229 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 993 transitions. Word has length 232 [2025-03-17 05:50:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:09,229 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 993 transitions. [2025-03-17 05:50:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 993 transitions. [2025-03-17 05:50:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-17 05:50:09,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:09,230 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 05:50:09,231 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1991183489, now seen corresponding path program 1 times [2025-03-17 05:50:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253142051] [2025-03-17 05:50:09,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:09,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-17 05:50:09,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-17 05:50:09,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:09,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2025-03-17 05:50:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253142051] [2025-03-17 05:50:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253142051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:50:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997831578] [2025-03-17 05:50:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:09,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:09,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:09,511 INFO L87 Difference]: Start difference. First operand 869 states and 993 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:09,688 INFO L93 Difference]: Finished difference Result 1377 states and 1569 transitions. [2025-03-17 05:50:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:50:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 232 [2025-03-17 05:50:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:09,690 INFO L225 Difference]: With dead ends: 1377 [2025-03-17 05:50:09,690 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 05:50:09,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:09,691 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:09,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 620 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 05:50:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 632. [2025-03-17 05:50:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 558 states have (on average 1.1164874551971327) internal successors, (623), 559 states have internal predecessors, (623), 50 states have call successors, (50), 23 states have call predecessors, (50), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:50:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 723 transitions. [2025-03-17 05:50:09,770 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 723 transitions. Word has length 232 [2025-03-17 05:50:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:09,771 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 723 transitions. [2025-03-17 05:50:09,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 723 transitions. [2025-03-17 05:50:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 05:50:09,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:09,772 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-17 05:50:09,772 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1729738116, now seen corresponding path program 1 times [2025-03-17 05:50:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230024755] [2025-03-17 05:50:09,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:09,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 05:50:09,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 05:50:09,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-17 05:50:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230024755] [2025-03-17 05:50:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230024755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310697141] [2025-03-17 05:50:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:10,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:50:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:50:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:10,061 INFO L87 Difference]: Start difference. First operand 632 states and 723 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:10,246 INFO L93 Difference]: Finished difference Result 1062 states and 1210 transitions. [2025-03-17 05:50:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:50:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-03-17 05:50:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:10,248 INFO L225 Difference]: With dead ends: 1062 [2025-03-17 05:50:10,248 INFO L226 Difference]: Without dead ends: 695 [2025-03-17 05:50:10,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:10,248 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 61 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:10,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 450 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:50:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-17 05:50:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 596. [2025-03-17 05:50:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 522 states have (on average 1.1015325670498084) internal successors, (575), 523 states have internal predecessors, (575), 50 states have call successors, (50), 23 states have call predecessors, (50), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:50:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 675 transitions. [2025-03-17 05:50:10,339 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 675 transitions. Word has length 236 [2025-03-17 05:50:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:10,339 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 675 transitions. [2025-03-17 05:50:10,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 675 transitions. [2025-03-17 05:50:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 05:50:10,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:10,341 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-17 05:50:10,341 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:10,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1197759998, now seen corresponding path program 1 times [2025-03-17 05:50:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:10,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372853944] [2025-03-17 05:50:10,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:10,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 05:50:10,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 05:50:10,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:10,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-17 05:50:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372853944] [2025-03-17 05:50:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372853944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:50:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891466628] [2025-03-17 05:50:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:11,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:50:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:11,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:50:11,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:50:11,069 INFO L87 Difference]: Start difference. First operand 596 states and 675 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:11,561 INFO L93 Difference]: Finished difference Result 976 states and 1105 transitions. [2025-03-17 05:50:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:50:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-03-17 05:50:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:11,563 INFO L225 Difference]: With dead ends: 976 [2025-03-17 05:50:11,564 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 05:50:11,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:50:11,568 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 120 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:11,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1057 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:50:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 05:50:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 597. [2025-03-17 05:50:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 523 states have (on average 1.0975143403441683) internal successors, (574), 524 states have internal predecessors, (574), 50 states have call successors, (50), 23 states have call predecessors, (50), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:50:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 674 transitions. [2025-03-17 05:50:11,662 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 674 transitions. Word has length 236 [2025-03-17 05:50:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 674 transitions. [2025-03-17 05:50:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 674 transitions. [2025-03-17 05:50:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 05:50:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:11,663 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:11,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-17 05:50:11,663 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:11,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -643718597, now seen corresponding path program 1 times [2025-03-17 05:50:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174040883] [2025-03-17 05:50:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:11,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 05:50:11,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 05:50:11,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2025-03-17 05:50:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174040883] [2025-03-17 05:50:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174040883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521672239] [2025-03-17 05:50:12,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:12,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:12,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:50:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 05:50:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 05:50:12,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:12,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:50:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:13,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 15 treesize of output 1 [2025-03-17 05:50:13,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:50:13,373 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 17 treesize of output 9 [2025-03-17 05:50:13,376 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 22 treesize of output 10 [2025-03-17 05:50:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 68 proven. 776 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-17 05:50:13,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:50:13,654 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 32 treesize of output 28 [2025-03-17 05:50:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 66 proven. 63 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2025-03-17 05:50:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521672239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:50:13,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:50:13,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2025-03-17 05:50:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170773493] [2025-03-17 05:50:13,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:50:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 05:50:13,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:13,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 05:50:13,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:50:13,834 INFO L87 Difference]: Start difference. First operand 597 states and 674 transitions. Second operand has 33 states, 30 states have (on average 7.033333333333333) internal successors, (211), 32 states have internal predecessors, (211), 9 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 7 states have call predecessors, (72), 9 states have call successors, (72) [2025-03-17 05:50:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:16,603 INFO L93 Difference]: Finished difference Result 1063 states and 1188 transitions. [2025-03-17 05:50:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-17 05:50:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 7.033333333333333) internal successors, (211), 32 states have internal predecessors, (211), 9 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 7 states have call predecessors, (72), 9 states have call successors, (72) Word has length 238 [2025-03-17 05:50:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:16,606 INFO L225 Difference]: With dead ends: 1063 [2025-03-17 05:50:16,606 INFO L226 Difference]: Without dead ends: 739 [2025-03-17 05:50:16,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1289, Invalid=6543, Unknown=0, NotChecked=0, Total=7832 [2025-03-17 05:50:16,607 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 628 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:16,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2266 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:50:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-17 05:50:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 579. [2025-03-17 05:50:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 505 states have (on average 1.0910891089108912) internal successors, (551), 506 states have internal predecessors, (551), 50 states have call successors, (50), 23 states have call predecessors, (50), 23 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:50:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 651 transitions. [2025-03-17 05:50:16,700 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 651 transitions. Word has length 238 [2025-03-17 05:50:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 651 transitions. [2025-03-17 05:50:16,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 7.033333333333333) internal successors, (211), 32 states have internal predecessors, (211), 9 states have call successors, (72), 3 states have call predecessors, (72), 5 states have return successors, (72), 7 states have call predecessors, (72), 9 states have call successors, (72) [2025-03-17 05:50:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 651 transitions. [2025-03-17 05:50:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 05:50:16,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:16,702 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:16,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:50:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-03-17 05:50:16,905 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2077680418, now seen corresponding path program 1 times [2025-03-17 05:50:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:16,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122079619] [2025-03-17 05:50:16,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:16,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 05:50:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 05:50:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-17 05:50:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122079619] [2025-03-17 05:50:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122079619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:50:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155737882] [2025-03-17 05:50:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:50:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:17,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:50:17,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:50:17,532 INFO L87 Difference]: Start difference. First operand 579 states and 651 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:17,931 INFO L93 Difference]: Finished difference Result 955 states and 1073 transitions. [2025-03-17 05:50:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:50:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 240 [2025-03-17 05:50:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:17,932 INFO L225 Difference]: With dead ends: 955 [2025-03-17 05:50:17,932 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:50:17,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:50:17,933 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:17,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1619 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:50:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:50:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:50:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 05:50:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:50:17,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2025-03-17 05:50:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:17,934 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:50:17,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:50:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:50:17,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:50:17,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:50:17,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-17 05:50:17,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:17,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.