./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:43:25,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:43:25,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:43:25,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:43:25,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:43:25,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:43:25,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:43:25,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:43:25,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:43:25,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:43:25,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:43:25,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:43:25,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:43:25,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:43:25,505 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:43:25,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:43:25,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:43:25,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:43:25,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:43:25,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:43:25,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:43:25,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:43:25,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:43:25,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:43:25,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 [2025-02-06 03:43:25,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:43:25,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:43:25,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:43:25,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:43:25,798 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:43:25,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2025-02-06 03:43:27,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ecf343be/d983532c942042a281104108e75662a1/FLAG6a0155b59 [2025-02-06 03:43:27,392 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:43:27,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2025-02-06 03:43:27,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ecf343be/d983532c942042a281104108e75662a1/FLAG6a0155b59 [2025-02-06 03:43:27,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ecf343be/d983532c942042a281104108e75662a1 [2025-02-06 03:43:27,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:43:27,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:43:27,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:43:27,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:43:27,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:43:27,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b97dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27, skipping insertion in model container [2025-02-06 03:43:27,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:43:27,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i[916,929] [2025-02-06 03:43:27,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:43:27,671 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:43:27,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i[916,929] [2025-02-06 03:43:27,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:43:27,750 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:43:27,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27 WrapperNode [2025-02-06 03:43:27,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:43:27,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:43:27,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:43:27,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:43:27,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,813 INFO L138 Inliner]: procedures = 26, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-02-06 03:43:27,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:43:27,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:43:27,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:43:27,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:43:27,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,871 INFO L175 MemorySlicer]: Split 138 memory accesses to 15 slices as follows [2, 11, 6, 22, 22, 22, 6, 8, 5, 3, 8, 7, 3, 6, 7]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:43:27,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:43:27,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:43:27,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:43:27,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:43:27,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (1/1) ... [2025-02-06 03:43:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:43:27,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:43:27,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:43:27,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:43:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:43:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:43:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:43:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:43:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:43:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:43:27,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:43:27,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:43:28,158 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:43:28,160 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:43:28,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-02-06 03:43:28,675 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-02-06 03:43:28,675 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:43:28,690 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:43:28,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:43:28,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:43:28 BoogieIcfgContainer [2025-02-06 03:43:28,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:43:28,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:43:28,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:43:28,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:43:28,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:43:27" (1/3) ... [2025-02-06 03:43:28,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b22721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:43:28, skipping insertion in model container [2025-02-06 03:43:28,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:43:27" (2/3) ... [2025-02-06 03:43:28,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b22721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:43:28, skipping insertion in model container [2025-02-06 03:43:28,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:43:28" (3/3) ... [2025-02-06 03:43:28,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-71.i [2025-02-06 03:43:28,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:43:28,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:43:28,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:43:28,797 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;@32964cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:43:28,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:43:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:43:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:43:28,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:28,816 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:28,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 248340166, now seen corresponding path program 1 times [2025-02-06 03:43:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760525556] [2025-02-06 03:43:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:43:28,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:43:28,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:43:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760525556] [2025-02-06 03:43:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760525556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:43:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339656419] [2025-02-06 03:43:29,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:43:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:43:29,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:43:29,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:43:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:43:29,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:43:29,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:29,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:43:29,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:43:29,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339656419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:29,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:43:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:43:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236045641] [2025-02-06 03:43:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:29,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:43:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:29,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:43:29,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:43:29,546 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:43:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:29,568 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-02-06 03:43:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:43:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-02-06 03:43:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:29,575 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:43:29,575 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:43:29,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:43:29,583 INFO L435 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:29,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:43:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:43:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:43:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-02-06 03:43:29,622 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-02-06 03:43:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:29,622 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-02-06 03:43:29,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:43:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-02-06 03:43:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:43:29,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:29,628 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:29,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:43:29,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:43:29,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:29,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1396385767, now seen corresponding path program 1 times [2025-02-06 03:43:29,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092812333] [2025-02-06 03:43:29,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:29,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:29,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:43:29,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:43:29,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:29,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092812333] [2025-02-06 03:43:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092812333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:43:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788965767] [2025-02-06 03:43:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:30,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:43:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:30,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:43:30,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:30,253 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:30,303 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-02-06 03:43:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:43:30,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-02-06 03:43:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:30,306 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:43:30,306 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:43:30,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:30,307 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 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-02-06 03:43:30,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:43:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 03:43:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:43:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-02-06 03:43:30,319 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-02-06 03:43:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-02-06 03:43:30,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-02-06 03:43:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:43:30,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:30,323 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:30,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:43:30,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -508882086, now seen corresponding path program 1 times [2025-02-06 03:43:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651126452] [2025-02-06 03:43:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:30,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:43:30,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:43:30,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:30,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651126452] [2025-02-06 03:43:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651126452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:30,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:43:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267962629] [2025-02-06 03:43:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:30,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:43:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:30,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:43:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:30,546 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:30,591 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-02-06 03:43:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:43:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-02-06 03:43:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:30,596 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:43:30,598 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:43:30,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:30,599 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 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-02-06 03:43:30,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:43:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 03:43:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:43:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-02-06 03:43:30,619 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-02-06 03:43:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:30,620 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-02-06 03:43:30,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-02-06 03:43:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:43:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:30,626 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:43:30,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -507958565, now seen corresponding path program 1 times [2025-02-06 03:43:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850988468] [2025-02-06 03:43:30,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:30,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:43:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:43:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850988468] [2025-02-06 03:43:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850988468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632097744] [2025-02-06 03:43:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:31,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:31,092 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:31,231 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2025-02-06 03:43:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-02-06 03:43:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:31,234 INFO L225 Difference]: With dead ends: 290 [2025-02-06 03:43:31,237 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 03:43:31,237 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-02-06 03:43:31,238 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 120 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:31,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 709 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 03:43:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-02-06 03:43:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3125) internal successors, (189), 145 states have internal predecessors, (189), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:43:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 247 transitions. [2025-02-06 03:43:31,262 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 247 transitions. Word has length 144 [2025-02-06 03:43:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:31,263 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 247 transitions. [2025-02-06 03:43:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 247 transitions. [2025-02-06 03:43:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:43:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:31,267 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:31,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:43:31,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1885272533, now seen corresponding path program 1 times [2025-02-06 03:43:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:31,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955998828] [2025-02-06 03:43:31,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:43:31,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:43:31,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:31,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955998828] [2025-02-06 03:43:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955998828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:31,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:31,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627701233] [2025-02-06 03:43:31,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:31,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:31,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:31,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:31,944 INFO L87 Difference]: Start difference. First operand 176 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:32,163 INFO L93 Difference]: Finished difference Result 443 states and 620 transitions. [2025-02-06 03:43:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-02-06 03:43:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:32,169 INFO L225 Difference]: With dead ends: 443 [2025-02-06 03:43:32,170 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 03:43:32,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:32,173 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 109 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:32,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 945 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 03:43:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2025-02-06 03:43:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 219 states have internal predecessors, (280), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:43:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 370 transitions. [2025-02-06 03:43:32,212 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 370 transitions. Word has length 145 [2025-02-06 03:43:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:32,213 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 370 transitions. [2025-02-06 03:43:32,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 370 transitions. [2025-02-06 03:43:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:43:32,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:32,216 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:43:32,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1860215656, now seen corresponding path program 1 times [2025-02-06 03:43:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337147329] [2025-02-06 03:43:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:32,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:43:32,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:43:32,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:32,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:32,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337147329] [2025-02-06 03:43:32,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337147329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:32,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:32,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640745123] [2025-02-06 03:43:32,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:32,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:32,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:32,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:32,977 INFO L87 Difference]: Start difference. First operand 266 states and 370 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:33,184 INFO L93 Difference]: Finished difference Result 517 states and 717 transitions. [2025-02-06 03:43:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:43:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-02-06 03:43:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:33,187 INFO L225 Difference]: With dead ends: 517 [2025-02-06 03:43:33,187 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 03:43:33,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:43:33,188 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 150 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:33,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 874 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 03:43:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2025-02-06 03:43:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 225 states have internal predecessors, (286), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:43:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2025-02-06 03:43:33,215 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 146 [2025-02-06 03:43:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:33,216 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2025-02-06 03:43:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2025-02-06 03:43:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:43:33,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:33,219 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:33,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:43:33,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:33,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash -593970330, now seen corresponding path program 1 times [2025-02-06 03:43:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-02-06 03:43:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:33,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:43:33,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:43:33,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-02-06 03:43:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001146097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350316212] [2025-02-06 03:43:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:33,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:33,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:33,479 INFO L87 Difference]: Start difference. First operand 273 states and 376 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:33,563 INFO L93 Difference]: Finished difference Result 512 states and 704 transitions. [2025-02-06 03:43:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:33,564 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-02-06 03:43:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:33,568 INFO L225 Difference]: With dead ends: 512 [2025-02-06 03:43:33,568 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:43:33,572 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-02-06 03:43:33,573 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:33,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 612 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:43:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 03:43:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 213 states have internal predecessors, (266), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:43:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 356 transitions. [2025-02-06 03:43:33,601 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 356 transitions. Word has length 146 [2025-02-06 03:43:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 356 transitions. [2025-02-06 03:43:33,602 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 356 transitions. [2025-02-06 03:43:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:43:33,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:33,606 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:33,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:43:33,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash -612255636, now seen corresponding path program 1 times [2025-02-06 03:43:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:33,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878355161] [2025-02-06 03:43:33,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:33,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:43:33,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:43:33,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:33,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878355161] [2025-02-06 03:43:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878355161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:33,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326319806] [2025-02-06 03:43:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:33,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:33,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:33,870 INFO L87 Difference]: Start difference. First operand 261 states and 356 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:33,935 INFO L93 Difference]: Finished difference Result 494 states and 673 transitions. [2025-02-06 03:43:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-02-06 03:43:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:33,939 INFO L225 Difference]: With dead ends: 494 [2025-02-06 03:43:33,940 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 03:43:33,943 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-02-06 03:43:33,944 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 55 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:33,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 662 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 03:43:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2025-02-06 03:43:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 207 states have internal predecessors, (256), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:43:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 346 transitions. [2025-02-06 03:43:33,967 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 346 transitions. Word has length 147 [2025-02-06 03:43:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 346 transitions. [2025-02-06 03:43:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 346 transitions. [2025-02-06 03:43:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:43:33,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:33,970 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:43:33,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:33,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1239965362, now seen corresponding path program 1 times [2025-02-06 03:43:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20157354] [2025-02-06 03:43:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:33,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:43:34,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:43:34,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:34,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20157354] [2025-02-06 03:43:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20157354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:34,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:43:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068058042] [2025-02-06 03:43:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:34,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:43:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:34,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:43:34,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:43:34,688 INFO L87 Difference]: Start difference. First operand 255 states and 346 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:35,097 INFO L93 Difference]: Finished difference Result 546 states and 739 transitions. [2025-02-06 03:43:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-02-06 03:43:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:35,101 INFO L225 Difference]: With dead ends: 546 [2025-02-06 03:43:35,101 INFO L226 Difference]: Without dead ends: 315 [2025-02-06 03:43:35,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:43:35,102 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 365 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:35,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 870 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:43:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-06 03:43:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2025-02-06 03:43:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 256 states have (on average 1.26171875) internal successors, (323), 260 states have internal predecessors, (323), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:43:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 421 transitions. [2025-02-06 03:43:35,134 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 421 transitions. Word has length 147 [2025-02-06 03:43:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:35,135 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 421 transitions. [2025-02-06 03:43:35,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 421 transitions. [2025-02-06 03:43:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:43:35,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:35,137 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:43:35,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1547450125, now seen corresponding path program 1 times [2025-02-06 03:43:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-02-06 03:43:35,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:43:35,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:43:35,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:35,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-02-06 03:43:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955995103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:35,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:43:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260660642] [2025-02-06 03:43:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:35,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:43:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:35,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:43:35,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:35,969 INFO L87 Difference]: Start difference. First operand 312 states and 421 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:36,735 INFO L93 Difference]: Finished difference Result 651 states and 869 transitions. [2025-02-06 03:43:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:43:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-02-06 03:43:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:36,739 INFO L225 Difference]: With dead ends: 651 [2025-02-06 03:43:36,739 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 03:43:36,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:43:36,741 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 128 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:36,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 925 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:43:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 03:43:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 316. [2025-02-06 03:43:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 258 states have (on average 1.251937984496124) internal successors, (323), 262 states have internal predecessors, (323), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:43:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 421 transitions. [2025-02-06 03:43:36,777 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 421 transitions. Word has length 147 [2025-02-06 03:43:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:36,777 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 421 transitions. [2025-02-06 03:43:36,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 421 transitions. [2025-02-06 03:43:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:43:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:36,779 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:36,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:43:36,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:36,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -837243981, now seen corresponding path program 1 times [2025-02-06 03:43:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:36,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980539735] [2025-02-06 03:43:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:36,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:43:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:43:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980539735] [2025-02-06 03:43:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980539735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:43:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070452136] [2025-02-06 03:43:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:38,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:43:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:38,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:43:38,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:43:38,084 INFO L87 Difference]: Start difference. First operand 316 states and 421 transitions. Second operand has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 03:43:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:39,434 INFO L93 Difference]: Finished difference Result 655 states and 869 transitions. [2025-02-06 03:43:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:43:39,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 147 [2025-02-06 03:43:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:39,438 INFO L225 Difference]: With dead ends: 655 [2025-02-06 03:43:39,438 INFO L226 Difference]: Without dead ends: 367 [2025-02-06 03:43:39,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:43:39,439 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 500 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:39,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 895 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:43:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-06 03:43:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2025-02-06 03:43:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 261 states have (on average 1.2452107279693487) internal successors, (325), 265 states have internal predecessors, (325), 49 states have call successors, (49), 9 states have call predecessors, (49), 9 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:43:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 423 transitions. [2025-02-06 03:43:39,474 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 423 transitions. Word has length 147 [2025-02-06 03:43:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:39,474 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 423 transitions. [2025-02-06 03:43:39,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 03:43:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2025-02-06 03:43:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:43:39,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:39,476 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:43:39,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 670307828, now seen corresponding path program 1 times [2025-02-06 03:43:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597318559] [2025-02-06 03:43:39,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:43:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:43:39,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597318559] [2025-02-06 03:43:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597318559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473289751] [2025-02-06 03:43:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:39,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:39,890 INFO L87 Difference]: Start difference. First operand 320 states and 423 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:40,035 INFO L93 Difference]: Finished difference Result 663 states and 881 transitions. [2025-02-06 03:43:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:43:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-02-06 03:43:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:40,038 INFO L225 Difference]: With dead ends: 663 [2025-02-06 03:43:40,039 INFO L226 Difference]: Without dead ends: 371 [2025-02-06 03:43:40,040 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-02-06 03:43:40,041 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 115 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:40,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1394 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-06 03:43:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 358. [2025-02-06 03:43:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 282 states have (on average 1.2234042553191489) internal successors, (345), 286 states have internal predecessors, (345), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:43:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 473 transitions. [2025-02-06 03:43:40,085 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 473 transitions. Word has length 147 [2025-02-06 03:43:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 473 transitions. [2025-02-06 03:43:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 473 transitions. [2025-02-06 03:43:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:43:40,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:40,087 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:43:40,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash -707932241, now seen corresponding path program 1 times [2025-02-06 03:43:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:40,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216351143] [2025-02-06 03:43:40,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:40,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:43:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:43:40,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:40,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216351143] [2025-02-06 03:43:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216351143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:40,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:43:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225145300] [2025-02-06 03:43:40,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:43:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:40,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:43:40,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:40,578 INFO L87 Difference]: Start difference. First operand 358 states and 473 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:40,913 INFO L93 Difference]: Finished difference Result 753 states and 998 transitions. [2025-02-06 03:43:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-02-06 03:43:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:40,917 INFO L225 Difference]: With dead ends: 753 [2025-02-06 03:43:40,917 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:43:40,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:40,919 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 86 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:40,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1149 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:43:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 420. [2025-02-06 03:43:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 337 states have (on average 1.2344213649851632) internal successors, (416), 342 states have internal predecessors, (416), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 556 transitions. [2025-02-06 03:43:40,968 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 556 transitions. Word has length 148 [2025-02-06 03:43:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 556 transitions. [2025-02-06 03:43:40,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 556 transitions. [2025-02-06 03:43:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:43:40,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:40,972 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:40,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:43:40,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash -369032846, now seen corresponding path program 1 times [2025-02-06 03:43:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610439411] [2025-02-06 03:43:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:40,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:43:41,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:43:41,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:41,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610439411] [2025-02-06 03:43:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610439411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775353135] [2025-02-06 03:43:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:41,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:41,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:41,157 INFO L87 Difference]: Start difference. First operand 420 states and 556 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:41,281 INFO L93 Difference]: Finished difference Result 815 states and 1080 transitions. [2025-02-06 03:43:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-02-06 03:43:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:41,284 INFO L225 Difference]: With dead ends: 815 [2025-02-06 03:43:41,284 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:43:41,287 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-02-06 03:43:41,287 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 96 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:41,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 584 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:43:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 420. [2025-02-06 03:43:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 337 states have (on average 1.231454005934718) internal successors, (415), 342 states have internal predecessors, (415), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 555 transitions. [2025-02-06 03:43:41,333 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 555 transitions. Word has length 148 [2025-02-06 03:43:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:41,334 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 555 transitions. [2025-02-06 03:43:41,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 555 transitions. [2025-02-06 03:43:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:43:41,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:41,336 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:41,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:43:41,336 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:41,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1008409781, now seen corresponding path program 1 times [2025-02-06 03:43:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553844781] [2025-02-06 03:43:41,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:41,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:43:41,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:43:41,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:41,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553844781] [2025-02-06 03:43:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553844781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:41,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391419710] [2025-02-06 03:43:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:41,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:41,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:41,513 INFO L87 Difference]: Start difference. First operand 420 states and 555 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:41,644 INFO L93 Difference]: Finished difference Result 815 states and 1078 transitions. [2025-02-06 03:43:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-02-06 03:43:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:41,648 INFO L225 Difference]: With dead ends: 815 [2025-02-06 03:43:41,648 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:43:41,651 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-02-06 03:43:41,652 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 100 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:41,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 578 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:43:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 420. [2025-02-06 03:43:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 337 states have (on average 1.228486646884273) internal successors, (414), 342 states have internal predecessors, (414), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 554 transitions. [2025-02-06 03:43:41,696 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 554 transitions. Word has length 148 [2025-02-06 03:43:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 554 transitions. [2025-02-06 03:43:41,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 554 transitions. [2025-02-06 03:43:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:43:41,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:41,699 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:41,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:43:41,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:41,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1933247818, now seen corresponding path program 1 times [2025-02-06 03:43:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774565234] [2025-02-06 03:43:41,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:41,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:43:41,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:43:41,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:41,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:41,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774565234] [2025-02-06 03:43:41,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774565234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:41,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:41,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793689462] [2025-02-06 03:43:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:41,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:41,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:41,888 INFO L87 Difference]: Start difference. First operand 420 states and 554 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:42,009 INFO L93 Difference]: Finished difference Result 813 states and 1071 transitions. [2025-02-06 03:43:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-02-06 03:43:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:42,013 INFO L225 Difference]: With dead ends: 813 [2025-02-06 03:43:42,013 INFO L226 Difference]: Without dead ends: 421 [2025-02-06 03:43:42,014 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-02-06 03:43:42,014 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 65 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:42,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 707 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-06 03:43:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-02-06 03:43:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 334 states have (on average 1.221556886227545) internal successors, (408), 339 states have internal predecessors, (408), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 548 transitions. [2025-02-06 03:43:42,061 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 548 transitions. Word has length 148 [2025-02-06 03:43:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 548 transitions. [2025-02-06 03:43:42,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 548 transitions. [2025-02-06 03:43:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:43:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:42,063 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:42,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:43:42,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1802377972, now seen corresponding path program 1 times [2025-02-06 03:43:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215257861] [2025-02-06 03:43:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:42,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:43:42,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:43:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:42,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215257861] [2025-02-06 03:43:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215257861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:43,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:43:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949875685] [2025-02-06 03:43:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:43:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:43,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:43:43,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:43:43,307 INFO L87 Difference]: Start difference. First operand 418 states and 548 transitions. Second operand has 17 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-02-06 03:43:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:44,538 INFO L93 Difference]: Finished difference Result 909 states and 1186 transitions. [2025-02-06 03:43:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:43:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 149 [2025-02-06 03:43:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:44,542 INFO L225 Difference]: With dead ends: 909 [2025-02-06 03:43:44,542 INFO L226 Difference]: Without dead ends: 519 [2025-02-06 03:43:44,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:43:44,544 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 338 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:44,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1408 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:43:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-06 03:43:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 435. [2025-02-06 03:43:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 351 states have (on average 1.225071225071225) internal successors, (430), 356 states have internal predecessors, (430), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 570 transitions. [2025-02-06 03:43:44,594 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 570 transitions. Word has length 149 [2025-02-06 03:43:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 570 transitions. [2025-02-06 03:43:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-02-06 03:43:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 570 transitions. [2025-02-06 03:43:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 03:43:44,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:44,597 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:43:44,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 512545742, now seen corresponding path program 1 times [2025-02-06 03:43:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661632601] [2025-02-06 03:43:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:44,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 03:43:44,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 03:43:44,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:44,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661632601] [2025-02-06 03:43:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661632601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:45,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053513531] [2025-02-06 03:43:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:45,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:45,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:45,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:45,180 INFO L87 Difference]: Start difference. First operand 435 states and 570 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:45,490 INFO L93 Difference]: Finished difference Result 907 states and 1189 transitions. [2025-02-06 03:43:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:43:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-02-06 03:43:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:45,494 INFO L225 Difference]: With dead ends: 907 [2025-02-06 03:43:45,494 INFO L226 Difference]: Without dead ends: 500 [2025-02-06 03:43:45,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:43:45,496 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 168 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:45,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1375 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-06 03:43:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 452. [2025-02-06 03:43:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 368 states have (on average 1.2282608695652173) internal successors, (452), 373 states have internal predecessors, (452), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 592 transitions. [2025-02-06 03:43:45,534 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 592 transitions. Word has length 149 [2025-02-06 03:43:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:45,534 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 592 transitions. [2025-02-06 03:43:45,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 592 transitions. [2025-02-06 03:43:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:45,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:45,536 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:45,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:43:45,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 619282477, now seen corresponding path program 1 times [2025-02-06 03:43:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920273089] [2025-02-06 03:43:45,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:45,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:45,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:45,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920273089] [2025-02-06 03:43:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920273089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:43:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446896603] [2025-02-06 03:43:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:43:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:46,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:43:46,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:43:46,087 INFO L87 Difference]: Start difference. First operand 452 states and 592 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:47,117 INFO L93 Difference]: Finished difference Result 984 states and 1291 transitions. [2025-02-06 03:43:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:43:47,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:43:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:47,121 INFO L225 Difference]: With dead ends: 984 [2025-02-06 03:43:47,121 INFO L226 Difference]: Without dead ends: 560 [2025-02-06 03:43:47,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:43:47,123 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 393 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:47,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 933 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:43:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-06 03:43:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 509. [2025-02-06 03:43:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 422 states have (on average 1.2417061611374407) internal successors, (524), 428 states have internal predecessors, (524), 72 states have call successors, (72), 14 states have call predecessors, (72), 14 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 03:43:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 668 transitions. [2025-02-06 03:43:47,162 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 668 transitions. Word has length 150 [2025-02-06 03:43:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:47,162 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 668 transitions. [2025-02-06 03:43:47,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 668 transitions. [2025-02-06 03:43:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:47,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:47,164 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:43:47,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:47,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash 108748300, now seen corresponding path program 1 times [2025-02-06 03:43:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:47,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706081807] [2025-02-06 03:43:47,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:47,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706081807] [2025-02-06 03:43:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706081807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:43:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692907657] [2025-02-06 03:43:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:43:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:47,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:43:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:47,655 INFO L87 Difference]: Start difference. First operand 509 states and 668 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:48,148 INFO L93 Difference]: Finished difference Result 1048 states and 1377 transitions. [2025-02-06 03:43:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:43:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:48,152 INFO L225 Difference]: With dead ends: 1048 [2025-02-06 03:43:48,152 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 03:43:48,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:43:48,156 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 348 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:48,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 686 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:43:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 03:43:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 561. [2025-02-06 03:43:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 471 states have (on average 1.2441613588110403) internal successors, (586), 478 states have internal predecessors, (586), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-06 03:43:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 734 transitions. [2025-02-06 03:43:48,200 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 734 transitions. Word has length 150 [2025-02-06 03:43:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:48,200 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 734 transitions. [2025-02-06 03:43:48,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 734 transitions. [2025-02-06 03:43:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:48,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:43:48,202 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1126233399, now seen corresponding path program 1 times [2025-02-06 03:43:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159692266] [2025-02-06 03:43:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:48,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:48,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:48,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:48,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159692266] [2025-02-06 03:43:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159692266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:50,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-06 03:43:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623749929] [2025-02-06 03:43:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:43:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:50,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:43:50,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:43:50,373 INFO L87 Difference]: Start difference. First operand 561 states and 734 transitions. Second operand has 22 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-02-06 03:43:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:52,655 INFO L93 Difference]: Finished difference Result 1316 states and 1718 transitions. [2025-02-06 03:43:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:43:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 150 [2025-02-06 03:43:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:52,661 INFO L225 Difference]: With dead ends: 1316 [2025-02-06 03:43:52,661 INFO L226 Difference]: Without dead ends: 783 [2025-02-06 03:43:52,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 03:43:52,665 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 625 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:52,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1431 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:43:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-06 03:43:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 654. [2025-02-06 03:43:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 556 states have (on average 1.2517985611510791) internal successors, (696), 564 states have internal predecessors, (696), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 72 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:43:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 856 transitions. [2025-02-06 03:43:52,713 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 856 transitions. Word has length 150 [2025-02-06 03:43:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:52,713 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 856 transitions. [2025-02-06 03:43:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.9) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-02-06 03:43:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 856 transitions. [2025-02-06 03:43:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:52,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:52,715 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:52,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:43:52,716 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1201568657, now seen corresponding path program 1 times [2025-02-06 03:43:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720998634] [2025-02-06 03:43:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:52,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:52,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720998634] [2025-02-06 03:43:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720998634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 03:43:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035593604] [2025-02-06 03:43:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:53,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:43:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:43:53,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:43:53,897 INFO L87 Difference]: Start difference. First operand 654 states and 856 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-02-06 03:43:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:54,933 INFO L93 Difference]: Finished difference Result 1287 states and 1684 transitions. [2025-02-06 03:43:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:43:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 150 [2025-02-06 03:43:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:54,941 INFO L225 Difference]: With dead ends: 1287 [2025-02-06 03:43:54,941 INFO L226 Difference]: Without dead ends: 661 [2025-02-06 03:43:54,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:43:54,945 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 318 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:54,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 984 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:43:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-06 03:43:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 555. [2025-02-06 03:43:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 467 states have (on average 1.246252676659529) internal successors, (582), 473 states have internal predecessors, (582), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 03:43:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 726 transitions. [2025-02-06 03:43:54,992 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 726 transitions. Word has length 150 [2025-02-06 03:43:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 726 transitions. [2025-02-06 03:43:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-02-06 03:43:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 726 transitions. [2025-02-06 03:43:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:54,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:54,995 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:54,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:43:54,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:54,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1312384174, now seen corresponding path program 1 times [2025-02-06 03:43:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645492110] [2025-02-06 03:43:54,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:55,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:55,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:55,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:55,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645492110] [2025-02-06 03:43:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645492110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:55,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075213336] [2025-02-06 03:43:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:55,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:55,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:55,257 INFO L87 Difference]: Start difference. First operand 555 states and 726 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:55,444 INFO L93 Difference]: Finished difference Result 1132 states and 1476 transitions. [2025-02-06 03:43:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-02-06 03:43:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:55,451 INFO L225 Difference]: With dead ends: 1132 [2025-02-06 03:43:55,451 INFO L226 Difference]: Without dead ends: 605 [2025-02-06 03:43:55,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:55,453 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 60 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:55,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 462 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-06 03:43:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 522. [2025-02-06 03:43:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 441 states have internal predecessors, (538), 70 states have call successors, (70), 15 states have call predecessors, (70), 15 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:43:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 678 transitions. [2025-02-06 03:43:55,498 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 678 transitions. Word has length 150 [2025-02-06 03:43:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:55,498 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 678 transitions. [2025-02-06 03:43:55,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 678 transitions. [2025-02-06 03:43:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:55,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:55,500 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:43:55,501 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:55,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash 801849997, now seen corresponding path program 1 times [2025-02-06 03:43:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321928066] [2025-02-06 03:43:55,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:55,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:55,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:55,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:55,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321928066] [2025-02-06 03:43:55,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321928066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:55,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:55,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:43:55,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253510513] [2025-02-06 03:43:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:55,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:43:55,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:55,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:43:55,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:43:55,770 INFO L87 Difference]: Start difference. First operand 522 states and 678 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:56,103 INFO L93 Difference]: Finished difference Result 1072 states and 1390 transitions. [2025-02-06 03:43:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-02-06 03:43:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:56,108 INFO L225 Difference]: With dead ends: 1072 [2025-02-06 03:43:56,108 INFO L226 Difference]: Without dead ends: 578 [2025-02-06 03:43:56,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:43:56,110 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 288 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:56,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 833 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-06 03:43:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 518. [2025-02-06 03:43:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 434 states have (on average 1.2327188940092166) internal successors, (535), 439 states have internal predecessors, (535), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:43:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 671 transitions. [2025-02-06 03:43:56,151 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 671 transitions. Word has length 150 [2025-02-06 03:43:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 671 transitions. [2025-02-06 03:43:56,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:43:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 671 transitions. [2025-02-06 03:43:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:56,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:56,153 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:56,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:43:56,153 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 897598001, now seen corresponding path program 1 times [2025-02-06 03:43:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577120532] [2025-02-06 03:43:56,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:56,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:56,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577120532] [2025-02-06 03:43:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577120532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:56,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733461541] [2025-02-06 03:43:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:56,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:56,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:56,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:56,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:56,307 INFO L87 Difference]: Start difference. First operand 518 states and 671 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:56,490 INFO L93 Difference]: Finished difference Result 1064 states and 1376 transitions. [2025-02-06 03:43:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:43:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-02-06 03:43:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:56,495 INFO L225 Difference]: With dead ends: 1064 [2025-02-06 03:43:56,495 INFO L226 Difference]: Without dead ends: 570 [2025-02-06 03:43:56,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:56,496 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 64 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:56,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1048 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-06 03:43:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 509. [2025-02-06 03:43:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 425 states have (on average 1.228235294117647) internal successors, (522), 430 states have internal predecessors, (522), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:43:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 658 transitions. [2025-02-06 03:43:56,541 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 658 transitions. Word has length 150 [2025-02-06 03:43:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:56,542 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 658 transitions. [2025-02-06 03:43:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 658 transitions. [2025-02-06 03:43:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:43:56,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:56,543 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:43:56,544 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:56,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1249153717, now seen corresponding path program 1 times [2025-02-06 03:43:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364978496] [2025-02-06 03:43:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:43:56,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:43:56,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364978496] [2025-02-06 03:43:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364978496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:43:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333035209] [2025-02-06 03:43:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:43:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:57,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:43:57,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:57,041 INFO L87 Difference]: Start difference. First operand 509 states and 658 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:57,392 INFO L93 Difference]: Finished difference Result 1216 states and 1568 transitions. [2025-02-06 03:43:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-02-06 03:43:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:57,396 INFO L225 Difference]: With dead ends: 1216 [2025-02-06 03:43:57,397 INFO L226 Difference]: Without dead ends: 731 [2025-02-06 03:43:57,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:43:57,398 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 74 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:57,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1366 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-02-06 03:43:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 627. [2025-02-06 03:43:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 526 states have (on average 1.226235741444867) internal successors, (645), 533 states have internal predecessors, (645), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:43:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 805 transitions. [2025-02-06 03:43:57,457 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 805 transitions. Word has length 150 [2025-02-06 03:43:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:57,458 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 805 transitions. [2025-02-06 03:43:57,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 805 transitions. [2025-02-06 03:43:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:43:57,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:57,460 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:43:57,461 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash -260679223, now seen corresponding path program 1 times [2025-02-06 03:43:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382044201] [2025-02-06 03:43:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:57,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:43:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:43:57,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:57,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382044201] [2025-02-06 03:43:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382044201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:43:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265709905] [2025-02-06 03:43:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:43:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:57,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:43:57,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:43:57,689 INFO L87 Difference]: Start difference. First operand 627 states and 805 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:57,828 INFO L93 Difference]: Finished difference Result 1316 states and 1684 transitions. [2025-02-06 03:43:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:57,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-02-06 03:43:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:57,832 INFO L225 Difference]: With dead ends: 1316 [2025-02-06 03:43:57,832 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 03:43:57,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:57,834 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 112 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:57,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 784 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 03:43:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 707. [2025-02-06 03:43:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 584 states have (on average 1.2123287671232876) internal successors, (708), 592 states have internal predecessors, (708), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:43:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 900 transitions. [2025-02-06 03:43:57,926 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 900 transitions. Word has length 151 [2025-02-06 03:43:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:57,927 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 900 transitions. [2025-02-06 03:43:57,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 900 transitions. [2025-02-06 03:43:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:43:57,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:57,929 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:43:57,929 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1105151094, now seen corresponding path program 1 times [2025-02-06 03:43:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305377093] [2025-02-06 03:43:57,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:57,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:43:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:43:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:58,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:58,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305377093] [2025-02-06 03:43:58,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305377093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:58,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:58,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:43:58,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868410320] [2025-02-06 03:43:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:58,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:43:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:58,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:43:58,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:43:58,210 INFO L87 Difference]: Start difference. First operand 707 states and 900 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:58,392 INFO L93 Difference]: Finished difference Result 1383 states and 1762 transitions. [2025-02-06 03:43:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-02-06 03:43:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:58,400 INFO L225 Difference]: With dead ends: 1383 [2025-02-06 03:43:58,400 INFO L226 Difference]: Without dead ends: 700 [2025-02-06 03:43:58,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:58,402 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 167 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:58,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 682 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-06 03:43:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 696. [2025-02-06 03:43:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 573 states have (on average 1.2076788830715532) internal successors, (692), 581 states have internal predecessors, (692), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:43:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 884 transitions. [2025-02-06 03:43:58,467 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 884 transitions. Word has length 151 [2025-02-06 03:43:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:58,467 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 884 transitions. [2025-02-06 03:43:58,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 884 transitions. [2025-02-06 03:43:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:43:58,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:58,471 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:58,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:43:58,471 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:58,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1805977649, now seen corresponding path program 1 times [2025-02-06 03:43:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135206571] [2025-02-06 03:43:58,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:43:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:43:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:58,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135206571] [2025-02-06 03:43:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135206571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:43:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626682790] [2025-02-06 03:43:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:58,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:43:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:58,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:43:58,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:43:58,681 INFO L87 Difference]: Start difference. First operand 696 states and 884 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:58,845 INFO L93 Difference]: Finished difference Result 1362 states and 1729 transitions. [2025-02-06 03:43:58,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:43:58,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-02-06 03:43:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:58,849 INFO L225 Difference]: With dead ends: 1362 [2025-02-06 03:43:58,850 INFO L226 Difference]: Without dead ends: 690 [2025-02-06 03:43:58,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:58,851 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 106 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:58,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 780 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:43:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-06 03:43:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 619. [2025-02-06 03:43:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 521 states have (on average 1.2149712092130518) internal successors, (633), 528 states have internal predecessors, (633), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:43:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 783 transitions. [2025-02-06 03:43:58,921 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 783 transitions. Word has length 151 [2025-02-06 03:43:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:58,921 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 783 transitions. [2025-02-06 03:43:58,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 783 transitions. [2025-02-06 03:43:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:43:58,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:58,923 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:58,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:43:58,923 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:58,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1049625743, now seen corresponding path program 1 times [2025-02-06 03:43:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352315457] [2025-02-06 03:43:58,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:58,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:43:58,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:43:58,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:58,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:43:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:43:59,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352315457] [2025-02-06 03:43:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352315457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:43:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189748736] [2025-02-06 03:43:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:43:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:43:59,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:43:59,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:43:59,363 INFO L87 Difference]: Start difference. First operand 619 states and 783 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:59,704 INFO L93 Difference]: Finished difference Result 1417 states and 1792 transitions. [2025-02-06 03:43:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:43:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:43:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:59,708 INFO L225 Difference]: With dead ends: 1417 [2025-02-06 03:43:59,709 INFO L226 Difference]: Without dead ends: 801 [2025-02-06 03:43:59,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:43:59,710 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 68 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:59,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1255 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:43:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-06 03:43:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 677. [2025-02-06 03:43:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 579 states have (on average 1.2227979274611398) internal successors, (708), 586 states have internal predecessors, (708), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:43:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 858 transitions. [2025-02-06 03:43:59,776 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 858 transitions. Word has length 152 [2025-02-06 03:43:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:59,776 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 858 transitions. [2025-02-06 03:43:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:43:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 858 transitions. [2025-02-06 03:43:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:43:59,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:59,778 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:59,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:43:59,778 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1737789744, now seen corresponding path program 1 times [2025-02-06 03:43:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:43:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998290602] [2025-02-06 03:43:59,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:43:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:43:59,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:43:59,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:59,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:00,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998290602] [2025-02-06 03:44:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998290602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:44:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145232778] [2025-02-06 03:44:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:44:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:44:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:00,063 INFO L87 Difference]: Start difference. First operand 677 states and 858 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:00,337 INFO L93 Difference]: Finished difference Result 1581 states and 1994 transitions. [2025-02-06 03:44:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:44:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:44:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:00,342 INFO L225 Difference]: With dead ends: 1581 [2025-02-06 03:44:00,343 INFO L226 Difference]: Without dead ends: 907 [2025-02-06 03:44:00,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:44:00,345 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 104 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:00,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 940 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-02-06 03:44:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 677. [2025-02-06 03:44:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 579 states have (on average 1.217616580310881) internal successors, (705), 586 states have internal predecessors, (705), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:44:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 855 transitions. [2025-02-06 03:44:00,409 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 855 transitions. Word has length 152 [2025-02-06 03:44:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 855 transitions. [2025-02-06 03:44:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 855 transitions. [2025-02-06 03:44:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:00,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:00,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:00,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:44:00,412 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:00,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 794889198, now seen corresponding path program 1 times [2025-02-06 03:44:00,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:00,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312815147] [2025-02-06 03:44:00,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:00,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:00,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:00,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312815147] [2025-02-06 03:44:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312815147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:44:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860841758] [2025-02-06 03:44:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:00,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:44:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:00,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:44:00,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:00,795 INFO L87 Difference]: Start difference. First operand 677 states and 855 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:01,192 INFO L93 Difference]: Finished difference Result 1400 states and 1760 transitions. [2025-02-06 03:44:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:44:01,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-02-06 03:44:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:01,198 INFO L225 Difference]: With dead ends: 1400 [2025-02-06 03:44:01,198 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 03:44:01,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:44:01,200 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 205 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:01,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 583 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 03:44:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 650. [2025-02-06 03:44:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 552 states have (on average 1.210144927536232) internal successors, (668), 559 states have internal predecessors, (668), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:44:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 818 transitions. [2025-02-06 03:44:01,271 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 818 transitions. Word has length 152 [2025-02-06 03:44:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 818 transitions. [2025-02-06 03:44:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 818 transitions. [2025-02-06 03:44:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:01,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:01,274 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:44:01,274 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 148616782, now seen corresponding path program 1 times [2025-02-06 03:44:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460280832] [2025-02-06 03:44:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:01,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:01,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:01,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:01,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460280832] [2025-02-06 03:44:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460280832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773715985] [2025-02-06 03:44:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:01,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:01,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:01,508 INFO L87 Difference]: Start difference. First operand 650 states and 818 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:01,740 INFO L93 Difference]: Finished difference Result 1378 states and 1728 transitions. [2025-02-06 03:44:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:44:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:01,744 INFO L225 Difference]: With dead ends: 1378 [2025-02-06 03:44:01,744 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 03:44:01,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:01,746 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 56 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:01,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 548 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 03:44:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 623. [2025-02-06 03:44:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 525 states have (on average 1.2019047619047618) internal successors, (631), 532 states have internal predecessors, (631), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:44:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 781 transitions. [2025-02-06 03:44:01,814 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 781 transitions. Word has length 152 [2025-02-06 03:44:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:01,815 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 781 transitions. [2025-02-06 03:44:01,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 781 transitions. [2025-02-06 03:44:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:01,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:01,817 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:01,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:44:01,817 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:01,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1656168591, now seen corresponding path program 1 times [2025-02-06 03:44:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353599617] [2025-02-06 03:44:01,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353599617] [2025-02-06 03:44:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353599617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:02,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:44:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266803923] [2025-02-06 03:44:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:44:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:44:02,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:44:02,098 INFO L87 Difference]: Start difference. First operand 623 states and 781 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:02,309 INFO L93 Difference]: Finished difference Result 1383 states and 1737 transitions. [2025-02-06 03:44:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:44:02,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:44:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:02,313 INFO L225 Difference]: With dead ends: 1383 [2025-02-06 03:44:02,313 INFO L226 Difference]: Without dead ends: 763 [2025-02-06 03:44:02,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:44:02,314 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 120 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:02,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2129 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-02-06 03:44:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 615. [2025-02-06 03:44:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 517 states have (on average 1.1992263056092842) internal successors, (620), 524 states have internal predecessors, (620), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 03:44:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 770 transitions. [2025-02-06 03:44:02,381 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 770 transitions. Word has length 152 [2025-02-06 03:44:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:02,381 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 770 transitions. [2025-02-06 03:44:02,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2025-02-06 03:44:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:02,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:02,383 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:02,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:44:02,383 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:02,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -985485601, now seen corresponding path program 1 times [2025-02-06 03:44:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929672592] [2025-02-06 03:44:02,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:02,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:02,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:02,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929672592] [2025-02-06 03:44:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929672592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:03,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:03,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:44:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066682784] [2025-02-06 03:44:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:03,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:44:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:03,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:44:03,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:44:03,251 INFO L87 Difference]: Start difference. First operand 615 states and 770 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:03,659 INFO L93 Difference]: Finished difference Result 655 states and 817 transitions. [2025-02-06 03:44:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:44:03,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-02-06 03:44:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:03,665 INFO L225 Difference]: With dead ends: 655 [2025-02-06 03:44:03,665 INFO L226 Difference]: Without dead ends: 653 [2025-02-06 03:44:03,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:44:03,666 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 282 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:03,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 706 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-06 03:44:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 595. [2025-02-06 03:44:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 504 states have (on average 1.1924603174603174) internal successors, (601), 510 states have internal predecessors, (601), 69 states have call successors, (69), 21 states have call predecessors, (69), 21 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 03:44:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 739 transitions. [2025-02-06 03:44:03,731 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 739 transitions. Word has length 152 [2025-02-06 03:44:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:03,731 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 739 transitions. [2025-02-06 03:44:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 739 transitions. [2025-02-06 03:44:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:03,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:03,732 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:03,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:44:03,733 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:03,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash -984562080, now seen corresponding path program 1 times [2025-02-06 03:44:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082001731] [2025-02-06 03:44:03,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:03,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:03,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:03,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:03,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082001731] [2025-02-06 03:44:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082001731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:03,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:03,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689498870] [2025-02-06 03:44:03,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:03,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:03,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:03,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:03,911 INFO L87 Difference]: Start difference. First operand 595 states and 739 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:04,029 INFO L93 Difference]: Finished difference Result 1243 states and 1543 transitions. [2025-02-06 03:44:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:44:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:04,033 INFO L225 Difference]: With dead ends: 1243 [2025-02-06 03:44:04,033 INFO L226 Difference]: Without dead ends: 651 [2025-02-06 03:44:04,034 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-02-06 03:44:04,035 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 93 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:04,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 659 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-06 03:44:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 650. [2025-02-06 03:44:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 537 states have (on average 1.1675977653631284) internal successors, (627), 544 states have internal predecessors, (627), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 03:44:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 799 transitions. [2025-02-06 03:44:04,158 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 799 transitions. Word has length 152 [2025-02-06 03:44:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:04,158 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 799 transitions. [2025-02-06 03:44:04,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 799 transitions. [2025-02-06 03:44:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:44:04,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:04,160 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:04,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 03:44:04,160 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:04,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash -97058399, now seen corresponding path program 1 times [2025-02-06 03:44:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:04,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356215764] [2025-02-06 03:44:04,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:04,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:04,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:04,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:44:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356215764] [2025-02-06 03:44:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356215764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454195599] [2025-02-06 03:44:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:04,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:04,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:04,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:44:04,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:44:04,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:44:04,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:04,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:04,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:44:04,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:04,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454195599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:44:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107122178] [2025-02-06 03:44:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:04,606 INFO L87 Difference]: Start difference. First operand 650 states and 799 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:04,714 INFO L93 Difference]: Finished difference Result 1267 states and 1559 transitions. [2025-02-06 03:44:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:04,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-02-06 03:44:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:04,718 INFO L225 Difference]: With dead ends: 1267 [2025-02-06 03:44:04,718 INFO L226 Difference]: Without dead ends: 671 [2025-02-06 03:44:04,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:04,720 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 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-02-06 03:44:04,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-06 03:44:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-02-06 03:44:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 558 states have (on average 1.1612903225806452) internal successors, (648), 565 states have internal predecessors, (648), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 03:44:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 820 transitions. [2025-02-06 03:44:04,833 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 820 transitions. Word has length 152 [2025-02-06 03:44:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:04,833 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 820 transitions. [2025-02-06 03:44:04,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 820 transitions. [2025-02-06 03:44:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:44:04,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:04,835 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:04,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:44:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 03:44:05,036 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:05,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash -35158103, now seen corresponding path program 1 times [2025-02-06 03:44:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390843835] [2025-02-06 03:44:05,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:44:05,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:44:05,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:05,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390843835] [2025-02-06 03:44:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390843835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:07,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:07,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-06 03:44:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497169675] [2025-02-06 03:44:07,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:07,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:44:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:07,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:44:07,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:44:07,207 INFO L87 Difference]: Start difference. First operand 671 states and 820 transitions. Second operand has 22 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 03:44:15,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:44:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:16,532 INFO L93 Difference]: Finished difference Result 1331 states and 1620 transitions. [2025-02-06 03:44:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:44:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 154 [2025-02-06 03:44:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:16,538 INFO L225 Difference]: With dead ends: 1331 [2025-02-06 03:44:16,538 INFO L226 Difference]: Without dead ends: 714 [2025-02-06 03:44:16,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:44:16,541 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 430 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1446 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 03:44:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-02-06 03:44:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 669. [2025-02-06 03:44:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 556 states have (on average 1.160071942446043) internal successors, (645), 563 states have internal predecessors, (645), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 03:44:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 817 transitions. [2025-02-06 03:44:16,621 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 817 transitions. Word has length 154 [2025-02-06 03:44:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:16,622 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 817 transitions. [2025-02-06 03:44:16,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 03:44:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 817 transitions. [2025-02-06 03:44:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:44:16,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:16,624 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 03:44:16,624 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1263033431, now seen corresponding path program 1 times [2025-02-06 03:44:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123929300] [2025-02-06 03:44:16,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:44:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:44:16,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123929300] [2025-02-06 03:44:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123929300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:44:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745591248] [2025-02-06 03:44:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:17,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:44:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:17,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:44:17,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:44:17,520 INFO L87 Difference]: Start difference. First operand 669 states and 817 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:18,145 INFO L93 Difference]: Finished difference Result 1425 states and 1737 transitions. [2025-02-06 03:44:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:44:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-02-06 03:44:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:18,148 INFO L225 Difference]: With dead ends: 1425 [2025-02-06 03:44:18,148 INFO L226 Difference]: Without dead ends: 810 [2025-02-06 03:44:18,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:44:18,150 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 163 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:18,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2047 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:44:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-02-06 03:44:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 754. [2025-02-06 03:44:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 617 states have (on average 1.1507293354943273) internal successors, (710), 625 states have internal predecessors, (710), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:44:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 920 transitions. [2025-02-06 03:44:18,251 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 920 transitions. Word has length 154 [2025-02-06 03:44:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:18,251 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 920 transitions. [2025-02-06 03:44:18,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:44:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 920 transitions. [2025-02-06 03:44:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:44:18,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:18,253 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 03:44:18,254 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1466836995, now seen corresponding path program 1 times [2025-02-06 03:44:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760037573] [2025-02-06 03:44:18,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:18,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:44:18,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:44:18,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:18,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:44:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760037573] [2025-02-06 03:44:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760037573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:19,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:44:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876179465] [2025-02-06 03:44:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:44:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:19,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:44:19,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:44:19,132 INFO L87 Difference]: Start difference. First operand 754 states and 920 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:19,889 INFO L93 Difference]: Finished difference Result 1865 states and 2254 transitions. [2025-02-06 03:44:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:44:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2025-02-06 03:44:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:19,895 INFO L225 Difference]: With dead ends: 1865 [2025-02-06 03:44:19,895 INFO L226 Difference]: Without dead ends: 1165 [2025-02-06 03:44:19,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:44:19,897 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 389 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:19,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 641 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:44:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-02-06 03:44:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 923. [2025-02-06 03:44:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 786 states have (on average 1.147582697201018) internal successors, (902), 794 states have internal predecessors, (902), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:44:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1112 transitions. [2025-02-06 03:44:19,998 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1112 transitions. Word has length 154 [2025-02-06 03:44:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:19,998 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1112 transitions. [2025-02-06 03:44:19,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-06 03:44:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1112 transitions. [2025-02-06 03:44:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:44:20,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:20,000 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 03:44:20,001 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:20,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1173433988, now seen corresponding path program 1 times [2025-02-06 03:44:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386274236] [2025-02-06 03:44:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:20,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:44:20,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:44:20,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:20,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat