./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:40:37,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:40:37,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:40:37,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:40:37,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:40:37,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:40:37,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:40:37,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:40:37,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:40:37,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:40:37,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:40:37,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:40:37,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:40:37,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:40:37,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:40:37,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:40:37,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:40:37,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:40:37,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:40:37,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:40:37,344 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 [2025-03-17 05:40:37,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:40:37,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:40:37,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:40:37,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:40:37,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:40:37,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2025-03-17 05:40:38,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ce6313f/d458257156524177b801a963fa0e3143/FLAG0295d67cf [2025-03-17 05:40:39,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:40:39,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2025-03-17 05:40:39,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ce6313f/d458257156524177b801a963fa0e3143/FLAG0295d67cf [2025-03-17 05:40:39,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ce6313f/d458257156524177b801a963fa0e3143 [2025-03-17 05:40:39,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:40:39,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:40:39,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:40:39,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:40:39,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:40:39,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39, skipping insertion in model container [2025-03-17 05:40:39,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:40:39,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2025-03-17 05:40:39,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:40:39,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:40:39,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2025-03-17 05:40:39,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:40:39,783 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:40:39,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39 WrapperNode [2025-03-17 05:40:39,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:40:39,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:40:39,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:40:39,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:40:39,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,830 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2025-03-17 05:40:39,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:40:39,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:40:39,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:40:39,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:40:39,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,864 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 44, 29, 5, 13, 14]. 41 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 5, 3, 1, 1, 2]. The 15 writes are split as follows [0, 8, 3, 1, 1, 2]. [2025-03-17 05:40:39,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:40:39,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:40:39,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:40:39,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:40:39,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (1/1) ... [2025-03-17 05:40:39,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:40:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:39,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:40:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:40:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:40:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:40:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:40:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:40:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:40:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:40:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:40:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:40:40,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:40:40,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:40:40,447 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem64#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~short63#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite100#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite99#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite98#1;havoc property_#t~mem88#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1; [2025-03-17 05:40:40,485 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-17 05:40:40,485 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:40:40,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:40:40,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:40:40,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:40:40 BoogieIcfgContainer [2025-03-17 05:40:40,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:40:40,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:40:40,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:40:40,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:40:40,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:40:39" (1/3) ... [2025-03-17 05:40:40,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129be1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:40:40, skipping insertion in model container [2025-03-17 05:40:40,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:39" (2/3) ... [2025-03-17 05:40:40,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129be1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:40:40, skipping insertion in model container [2025-03-17 05:40:40,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:40:40" (3/3) ... [2025-03-17 05:40:40,515 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-89.i [2025-03-17 05:40:40,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:40:40,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-89.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:40:40,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:40:40,619 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;@1991c19d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:40:40,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:40:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:40,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:40,640 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:40,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:40,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1666578970, now seen corresponding path program 1 times [2025-03-17 05:40:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231818312] [2025-03-17 05:40:40,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:40,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:40,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:40,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:40,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:40:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231818312] [2025-03-17 05:40:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231818312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828557958] [2025-03-17 05:40:40,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:40,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:40,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:40,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:40:40,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:40:41,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:41,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:41,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:41,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:41,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:40:41,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:40:41,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:40:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828557958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:40:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:40:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339391555] [2025-03-17 05:40:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:40:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:41,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:40:41,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:40:41,225 INFO L87 Difference]: Start difference. First operand has 96 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:40:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:41,251 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2025-03-17 05:40:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:40:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2025-03-17 05:40:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:41,259 INFO L225 Difference]: With dead ends: 189 [2025-03-17 05:40:41,259 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:40:41,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:40:41,265 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:41,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:40:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 05:40:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-03-17 05:40:41,300 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 105 [2025-03-17 05:40:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:41,300 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-03-17 05:40:41,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:40:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-03-17 05:40:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:41,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:41,302 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:41,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:40:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:40:41,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:41,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash 275533299, now seen corresponding path program 1 times [2025-03-17 05:40:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:41,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-17 05:40:41,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:41,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:41,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-17 05:40:41,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954014105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:41,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:41,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:41,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93471746] [2025-03-17 05:40:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:41,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:41,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:41,818 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:41,863 INFO L93 Difference]: Finished difference Result 190 states and 277 transitions. [2025-03-17 05:40:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:41,866 INFO L225 Difference]: With dead ends: 190 [2025-03-17 05:40:41,869 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:40:41,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:41,871 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:41,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:40:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 05:40:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2025-03-17 05:40:41,886 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 105 [2025-03-17 05:40:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:41,887 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2025-03-17 05:40:41,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2025-03-17 05:40:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:41,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:41,890 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:40:41,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1531921164, now seen corresponding path program 1 times [2025-03-17 05:40:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405600840] [2025-03-17 05:40:41,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:41,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:42,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405600840] [2025-03-17 05:40:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405600840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443680249] [2025-03-17 05:40:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:42,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:42,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:42,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:42,118 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:42,160 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-03-17 05:40:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:42,162 INFO L225 Difference]: With dead ends: 194 [2025-03-17 05:40:42,162 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 05:40:42,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:42,167 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:42,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 05:40:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-17 05:40:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2025-03-17 05:40:42,178 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 105 [2025-03-17 05:40:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:42,178 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2025-03-17 05:40:42,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2025-03-17 05:40:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:42,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:42,180 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:42,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:40:42,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash -644417483, now seen corresponding path program 1 times [2025-03-17 05:40:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-03-17 05:40:42,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:42,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:42,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:42,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:42,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:42,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-03-17 05:40:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947834570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143418138] [2025-03-17 05:40:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:42,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:42,345 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:42,380 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2025-03-17 05:40:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:42,382 INFO L225 Difference]: With dead ends: 198 [2025-03-17 05:40:42,382 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 05:40:42,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:42,384 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:42,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 388 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 05:40:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 05:40:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-03-17 05:40:42,393 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 105 [2025-03-17 05:40:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:42,393 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-03-17 05:40:42,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-03-17 05:40:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:42,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:42,395 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:40:42,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -643493962, now seen corresponding path program 1 times [2025-03-17 05:40:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105611582] [2025-03-17 05:40:42,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:42,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:42,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:43,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105611582] [2025-03-17 05:40:43,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105611582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:43,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:40:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466540757] [2025-03-17 05:40:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:43,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:40:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:43,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:40:43,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:43,756 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:44,229 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2025-03-17 05:40:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:40:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:44,232 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:40:44,232 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 05:40:44,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:40:44,232 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 266 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:44,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 655 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:40:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 05:40:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 111. [2025-03-17 05:40:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-17 05:40:44,245 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 105 [2025-03-17 05:40:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-17 05:40:44,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-17 05:40:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:44,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:44,247 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:40:44,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1154028139, now seen corresponding path program 1 times [2025-03-17 05:40:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25340862] [2025-03-17 05:40:44,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:44,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25340862] [2025-03-17 05:40:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25340862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205059901] [2025-03-17 05:40:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:44,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:44,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:44,660 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:44,850 INFO L93 Difference]: Finished difference Result 277 states and 396 transitions. [2025-03-17 05:40:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:44,852 INFO L225 Difference]: With dead ends: 277 [2025-03-17 05:40:44,852 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 05:40:44,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:44,852 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 332 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:44,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 373 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 05:40:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 120. [2025-03-17 05:40:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-03-17 05:40:44,860 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 105 [2025-03-17 05:40:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:44,860 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-03-17 05:40:44,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-03-17 05:40:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:44,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:44,861 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:44,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:40:44,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1454868686, now seen corresponding path program 1 times [2025-03-17 05:40:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964573291] [2025-03-17 05:40:44,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:44,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:45,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:45,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:45,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:40:46,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:46,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964573291] [2025-03-17 05:40:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964573291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:40:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98153371] [2025-03-17 05:40:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:40:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:46,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:40:46,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:40:46,632 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:40:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:48,145 INFO L93 Difference]: Finished difference Result 331 states and 468 transitions. [2025-03-17 05:40:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:40:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2025-03-17 05:40:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:48,147 INFO L225 Difference]: With dead ends: 331 [2025-03-17 05:40:48,147 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 05:40:48,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:40:48,148 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 739 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:48,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 709 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:40:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 05:40:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2025-03-17 05:40:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 122 states have internal predecessors, (169), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2025-03-17 05:40:48,162 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 105 [2025-03-17 05:40:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2025-03-17 05:40:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:40:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2025-03-17 05:40:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:48,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:48,163 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:40:48,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1613417045, now seen corresponding path program 1 times [2025-03-17 05:40:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335980811] [2025-03-17 05:40:48,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:48,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:48,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:48,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:48,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335980811] [2025-03-17 05:40:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335980811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:48,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914619781] [2025-03-17 05:40:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:48,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:48,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:48,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:48,484 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:48,733 INFO L93 Difference]: Finished difference Result 324 states and 455 transitions. [2025-03-17 05:40:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:40:48,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:48,735 INFO L225 Difference]: With dead ends: 324 [2025-03-17 05:40:48,735 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 05:40:48,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:48,736 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:48,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 422 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 05:40:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2025-03-17 05:40:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2025-03-17 05:40:48,765 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 105 [2025-03-17 05:40:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:48,765 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2025-03-17 05:40:48,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2025-03-17 05:40:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:48,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:48,766 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:40:48,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:48,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1102882868, now seen corresponding path program 1 times [2025-03-17 05:40:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956511809] [2025-03-17 05:40:48,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:48,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:49,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:49,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956511809] [2025-03-17 05:40:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956511809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:49,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:40:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505397554] [2025-03-17 05:40:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:49,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:40:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:49,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:40:49,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:49,160 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:49,383 INFO L93 Difference]: Finished difference Result 329 states and 459 transitions. [2025-03-17 05:40:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:40:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:49,386 INFO L225 Difference]: With dead ends: 329 [2025-03-17 05:40:49,386 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 05:40:49,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:40:49,387 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 67 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:49,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 997 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 05:40:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2025-03-17 05:40:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:40:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2025-03-17 05:40:49,401 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 105 [2025-03-17 05:40:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:49,402 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2025-03-17 05:40:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2025-03-17 05:40:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:49,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:49,403 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:40:49,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1684269618, now seen corresponding path program 1 times [2025-03-17 05:40:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259628687] [2025-03-17 05:40:49,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:49,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:49,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:49,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:49,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:40:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259628687] [2025-03-17 05:40:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259628687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:40:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304415862] [2025-03-17 05:40:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:40:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:51,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:40:51,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:40:51,103 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 05:40:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:54,383 INFO L93 Difference]: Finished difference Result 525 states and 725 transitions. [2025-03-17 05:40:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:40:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 105 [2025-03-17 05:40:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:54,386 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:40:54,386 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 05:40:54,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:40:54,388 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 674 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:54,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1410 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 05:40:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 05:40:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 299. [2025-03-17 05:40:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 262 states have internal predecessors, (353), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:40:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 417 transitions. [2025-03-17 05:40:54,424 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 417 transitions. Word has length 105 [2025-03-17 05:40:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 417 transitions. [2025-03-17 05:40:54,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 05:40:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 417 transitions. [2025-03-17 05:40:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:54,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:54,426 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:40:54,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 872894894, now seen corresponding path program 1 times [2025-03-17 05:40:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81211902] [2025-03-17 05:40:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:54,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:54,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:54,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:54,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:55,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81211902] [2025-03-17 05:40:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81211902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:55,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:40:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695552130] [2025-03-17 05:40:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:40:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:55,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:40:55,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:40:55,304 INFO L87 Difference]: Start difference. First operand 299 states and 417 transitions. Second operand has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 05:40:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:55,914 INFO L93 Difference]: Finished difference Result 705 states and 989 transitions. [2025-03-17 05:40:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:40:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 4 states have call successors, (13) Word has length 105 [2025-03-17 05:40:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:55,920 INFO L225 Difference]: With dead ends: 705 [2025-03-17 05:40:55,920 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 05:40:55,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:40:55,921 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 252 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:55,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 979 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:40:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 05:40:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 317. [2025-03-17 05:40:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 279 states have (on average 1.3620071684587813) internal successors, (380), 280 states have internal predecessors, (380), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:40:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 444 transitions. [2025-03-17 05:40:55,975 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 444 transitions. Word has length 105 [2025-03-17 05:40:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:55,975 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 444 transitions. [2025-03-17 05:40:55,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 05:40:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 444 transitions. [2025-03-17 05:40:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:55,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:55,976 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:40:55,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:55,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 362360717, now seen corresponding path program 1 times [2025-03-17 05:40:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-03-17 05:40:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:56,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:56,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:56,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-03-17 05:40:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950049322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792526347] [2025-03-17 05:40:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:56,214 INFO L87 Difference]: Start difference. First operand 317 states and 444 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:56,457 INFO L93 Difference]: Finished difference Result 729 states and 1023 transitions. [2025-03-17 05:40:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:56,459 INFO L225 Difference]: With dead ends: 729 [2025-03-17 05:40:56,459 INFO L226 Difference]: Without dead ends: 429 [2025-03-17 05:40:56,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:56,460 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 182 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:56,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 580 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-17 05:40:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 335. [2025-03-17 05:40:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 297 states have (on average 1.3636363636363635) internal successors, (405), 298 states have internal predecessors, (405), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:40:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 469 transitions. [2025-03-17 05:40:56,505 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 469 transitions. Word has length 105 [2025-03-17 05:40:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:56,506 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 469 transitions. [2025-03-17 05:40:56,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 469 transitions. [2025-03-17 05:40:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:56,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:56,508 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:40:56,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:56,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1165161395, now seen corresponding path program 1 times [2025-03-17 05:40:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967858847] [2025-03-17 05:40:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:56,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:56,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:56,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:56,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967858847] [2025-03-17 05:40:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967858847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:56,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378626861] [2025-03-17 05:40:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:56,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:56,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:56,715 INFO L87 Difference]: Start difference. First operand 335 states and 469 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:56,945 INFO L93 Difference]: Finished difference Result 751 states and 1051 transitions. [2025-03-17 05:40:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:40:56,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:56,950 INFO L225 Difference]: With dead ends: 751 [2025-03-17 05:40:56,950 INFO L226 Difference]: Without dead ends: 433 [2025-03-17 05:40:56,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:56,951 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 181 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:56,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 504 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-17 05:40:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 341. [2025-03-17 05:40:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 303 states have (on average 1.3597359735973598) internal successors, (412), 304 states have internal predecessors, (412), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:40:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2025-03-17 05:40:56,982 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 105 [2025-03-17 05:40:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2025-03-17 05:40:56,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2025-03-17 05:40:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:40:56,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:56,984 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:56,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:40:56,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:56,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1675695572, now seen corresponding path program 1 times [2025-03-17 05:40:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:56,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786056344] [2025-03-17 05:40:56,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:56,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:40:57,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:40:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786056344] [2025-03-17 05:40:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786056344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:57,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:40:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025324619] [2025-03-17 05:40:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:40:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:57,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:40:57,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:57,249 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:57,430 INFO L93 Difference]: Finished difference Result 763 states and 1064 transitions. [2025-03-17 05:40:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:40:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-03-17 05:40:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:57,434 INFO L225 Difference]: With dead ends: 763 [2025-03-17 05:40:57,434 INFO L226 Difference]: Without dead ends: 439 [2025-03-17 05:40:57,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:40:57,435 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 74 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:57,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1010 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-17 05:40:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 347. [2025-03-17 05:40:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 309 states have (on average 1.3559870550161812) internal successors, (419), 310 states have internal predecessors, (419), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:40:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 483 transitions. [2025-03-17 05:40:57,464 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 483 transitions. Word has length 105 [2025-03-17 05:40:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:57,464 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 483 transitions. [2025-03-17 05:40:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 483 transitions. [2025-03-17 05:40:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:40:57,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:57,467 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:57,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:40:57,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -914194416, now seen corresponding path program 1 times [2025-03-17 05:40:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461733441] [2025-03-17 05:40:57,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:57,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:40:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:40:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461733441] [2025-03-17 05:40:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461733441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:57,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:57,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281192356] [2025-03-17 05:40:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:57,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:57,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:57,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:57,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:57,630 INFO L87 Difference]: Start difference. First operand 347 states and 483 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:57,830 INFO L93 Difference]: Finished difference Result 829 states and 1151 transitions. [2025-03-17 05:40:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2025-03-17 05:40:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:57,834 INFO L225 Difference]: With dead ends: 829 [2025-03-17 05:40:57,835 INFO L226 Difference]: Without dead ends: 499 [2025-03-17 05:40:57,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:57,837 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 107 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:57,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 483 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-17 05:40:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 462. [2025-03-17 05:40:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 415 states have (on average 1.3518072289156626) internal successors, (561), 415 states have internal predecessors, (561), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:40:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2025-03-17 05:40:57,910 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 107 [2025-03-17 05:40:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:57,911 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2025-03-17 05:40:57,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2025-03-17 05:40:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:40:57,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:57,912 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:57,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:40:57,913 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:57,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1758864496, now seen corresponding path program 1 times [2025-03-17 05:40:57,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:57,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-03-17 05:40:57,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:57,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:40:57,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:40:57,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:57,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:40:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-03-17 05:40:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346600055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691082224] [2025-03-17 05:40:58,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:58,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:40:58,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:40:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:40:58,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:40:58,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:58,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:58,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:40:58,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:58,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:40:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691082224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:40:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:40:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842668181] [2025-03-17 05:40:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:58,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:58,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:58,185 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:58,239 INFO L93 Difference]: Finished difference Result 798 states and 1108 transitions. [2025-03-17 05:40:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2025-03-17 05:40:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:58,242 INFO L225 Difference]: With dead ends: 798 [2025-03-17 05:40:58,242 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 05:40:58,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:58,244 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:58,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 05:40:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-17 05:40:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 421 states have (on average 1.3467933491686461) internal successors, (567), 421 states have internal predecessors, (567), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:40:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 645 transitions. [2025-03-17 05:40:58,280 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 645 transitions. Word has length 107 [2025-03-17 05:40:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 645 transitions. [2025-03-17 05:40:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 645 transitions. [2025-03-17 05:40:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:40:58,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:58,281 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:58,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:40:58,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:40:58,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:58,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2012338422, now seen corresponding path program 1 times [2025-03-17 05:40:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247193426] [2025-03-17 05:40:58,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:58,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:58,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:40:58,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:40:58,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:58,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:40:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:59,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247193426] [2025-03-17 05:40:59,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247193426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:59,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:59,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:40:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610874429] [2025-03-17 05:40:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:59,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:40:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:59,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:40:59,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:40:59,180 INFO L87 Difference]: Start difference. First operand 468 states and 645 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:59,641 INFO L93 Difference]: Finished difference Result 1072 states and 1490 transitions. [2025-03-17 05:40:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:40:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2025-03-17 05:40:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:59,644 INFO L225 Difference]: With dead ends: 1072 [2025-03-17 05:40:59,645 INFO L226 Difference]: Without dead ends: 736 [2025-03-17 05:40:59,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:40:59,647 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 185 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:59,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 891 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:40:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-17 05:40:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 547. [2025-03-17 05:40:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 500 states have (on average 1.392) internal successors, (696), 500 states have internal predecessors, (696), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:40:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 774 transitions. [2025-03-17 05:40:59,687 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 774 transitions. Word has length 108 [2025-03-17 05:40:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 774 transitions. [2025-03-17 05:40:59,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:40:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 774 transitions. [2025-03-17 05:40:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:40:59,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:59,689 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:40:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:40:59,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:59,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1772094697, now seen corresponding path program 1 times [2025-03-17 05:40:59,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:59,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980539735] [2025-03-17 05:40:59,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:59,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:40:59,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:40:59,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:59,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:00,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980539735] [2025-03-17 05:41:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980539735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:41:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348822404] [2025-03-17 05:41:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:41:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:00,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:41:00,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:00,011 INFO L87 Difference]: Start difference. First operand 547 states and 774 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:41:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:00,293 INFO L93 Difference]: Finished difference Result 1080 states and 1521 transitions. [2025-03-17 05:41:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-17 05:41:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:00,298 INFO L225 Difference]: With dead ends: 1080 [2025-03-17 05:41:00,298 INFO L226 Difference]: Without dead ends: 680 [2025-03-17 05:41:00,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:00,299 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 431 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:00,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 441 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-17 05:41:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 559. [2025-03-17 05:41:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 512 states have (on average 1.39453125) internal successors, (714), 512 states have internal predecessors, (714), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 792 transitions. [2025-03-17 05:41:00,339 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 792 transitions. Word has length 108 [2025-03-17 05:41:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:00,340 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 792 transitions. [2025-03-17 05:41:00,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:41:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 792 transitions. [2025-03-17 05:41:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:41:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:00,341 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:41:00,342 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1800987509, now seen corresponding path program 1 times [2025-03-17 05:41:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704918420] [2025-03-17 05:41:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:00,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:41:00,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:41:00,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:00,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704918420] [2025-03-17 05:41:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704918420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:41:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063829815] [2025-03-17 05:41:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:41:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:00,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:41:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:00,379 INFO L87 Difference]: Start difference. First operand 559 states and 792 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:00,418 INFO L93 Difference]: Finished difference Result 935 states and 1323 transitions. [2025-03-17 05:41:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:41:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2025-03-17 05:41:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:00,421 INFO L225 Difference]: With dead ends: 935 [2025-03-17 05:41:00,421 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 05:41:00,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:00,423 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:00,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 05:41:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-03-17 05:41:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 431 states have (on average 1.3480278422273781) internal successors, (581), 431 states have internal predecessors, (581), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 659 transitions. [2025-03-17 05:41:00,458 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 659 transitions. Word has length 108 [2025-03-17 05:41:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 659 transitions. [2025-03-17 05:41:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 659 transitions. [2025-03-17 05:41:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:41:00,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:00,460 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:41:00,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash -305114646, now seen corresponding path program 1 times [2025-03-17 05:41:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016690460] [2025-03-17 05:41:00,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:00,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:41:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:41:00,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:00,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:00,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:00,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016690460] [2025-03-17 05:41:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016690460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656950955] [2025-03-17 05:41:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:00,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:00,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:00,595 INFO L87 Difference]: Start difference. First operand 478 states and 659 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:00,692 INFO L93 Difference]: Finished difference Result 893 states and 1227 transitions. [2025-03-17 05:41:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2025-03-17 05:41:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:00,694 INFO L225 Difference]: With dead ends: 893 [2025-03-17 05:41:00,695 INFO L226 Difference]: Without dead ends: 529 [2025-03-17 05:41:00,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:00,697 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 57 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:00,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 632 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-17 05:41:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 432. [2025-03-17 05:41:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 385 states have (on average 1.3376623376623376) internal successors, (515), 385 states have internal predecessors, (515), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 593 transitions. [2025-03-17 05:41:00,734 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 593 transitions. Word has length 108 [2025-03-17 05:41:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:00,735 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 593 transitions. [2025-03-17 05:41:00,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 593 transitions. [2025-03-17 05:41:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:41:00,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:00,736 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:00,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:41:00,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1334104714, now seen corresponding path program 1 times [2025-03-17 05:41:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-03-17 05:41:00,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:41:00,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:41:00,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-03-17 05:41:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105743405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:41:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756670692] [2025-03-17 05:41:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:41:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:41:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:41:01,615 INFO L87 Difference]: Start difference. First operand 432 states and 593 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 05:41:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:02,477 INFO L93 Difference]: Finished difference Result 947 states and 1295 transitions. [2025-03-17 05:41:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:41:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2025-03-17 05:41:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:02,481 INFO L225 Difference]: With dead ends: 947 [2025-03-17 05:41:02,481 INFO L226 Difference]: Without dead ends: 634 [2025-03-17 05:41:02,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:41:02,483 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 376 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:02,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1445 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:41:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-17 05:41:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 425. [2025-03-17 05:41:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 378 states have (on average 1.343915343915344) internal successors, (508), 378 states have internal predecessors, (508), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 586 transitions. [2025-03-17 05:41:02,533 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 586 transitions. Word has length 108 [2025-03-17 05:41:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 586 transitions. [2025-03-17 05:41:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 05:41:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 586 transitions. [2025-03-17 05:41:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:41:02,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:02,535 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:41:02,535 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 823570537, now seen corresponding path program 1 times [2025-03-17 05:41:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396109454] [2025-03-17 05:41:02,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:41:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:41:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396109454] [2025-03-17 05:41:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396109454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:02,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:02,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:41:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742742623] [2025-03-17 05:41:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:41:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:02,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:41:02,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:02,971 INFO L87 Difference]: Start difference. First operand 425 states and 586 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:41:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:03,277 INFO L93 Difference]: Finished difference Result 853 states and 1175 transitions. [2025-03-17 05:41:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:03,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-17 05:41:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:03,280 INFO L225 Difference]: With dead ends: 853 [2025-03-17 05:41:03,280 INFO L226 Difference]: Without dead ends: 540 [2025-03-17 05:41:03,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:03,289 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 343 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:03,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 484 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-17 05:41:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 431. [2025-03-17 05:41:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 384 states have (on average 1.3463541666666667) internal successors, (517), 384 states have internal predecessors, (517), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 595 transitions. [2025-03-17 05:41:03,342 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 595 transitions. Word has length 108 [2025-03-17 05:41:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 595 transitions. [2025-03-17 05:41:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 05:41:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 595 transitions. [2025-03-17 05:41:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:41:03,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:03,344 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:03,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:41:03,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1253638806, now seen corresponding path program 1 times [2025-03-17 05:41:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970968231] [2025-03-17 05:41:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:03,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:41:03,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:41:03,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:03,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970968231] [2025-03-17 05:41:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970968231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587665773] [2025-03-17 05:41:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:03,514 INFO L87 Difference]: Start difference. First operand 431 states and 595 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:03,673 INFO L93 Difference]: Finished difference Result 817 states and 1120 transitions. [2025-03-17 05:41:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2025-03-17 05:41:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:03,676 INFO L225 Difference]: With dead ends: 817 [2025-03-17 05:41:03,676 INFO L226 Difference]: Without dead ends: 483 [2025-03-17 05:41:03,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:03,680 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 62 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:03,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 640 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-17 05:41:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 379. [2025-03-17 05:41:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 332 states have (on average 1.3253012048192772) internal successors, (440), 332 states have internal predecessors, (440), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 518 transitions. [2025-03-17 05:41:03,729 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 518 transitions. Word has length 108 [2025-03-17 05:41:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:03,729 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 518 transitions. [2025-03-17 05:41:03,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 518 transitions. [2025-03-17 05:41:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:41:03,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:03,731 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:03,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:41:03,731 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 866956852, now seen corresponding path program 1 times [2025-03-17 05:41:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941814163] [2025-03-17 05:41:03,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:03,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:41:03,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:41:03,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:03,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941814163] [2025-03-17 05:41:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941814163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:04,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:04,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:41:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393869479] [2025-03-17 05:41:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:41:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:04,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:41:04,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:04,112 INFO L87 Difference]: Start difference. First operand 379 states and 518 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:04,327 INFO L93 Difference]: Finished difference Result 387 states and 527 transitions. [2025-03-17 05:41:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:41:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-17 05:41:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:04,330 INFO L225 Difference]: With dead ends: 387 [2025-03-17 05:41:04,330 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 05:41:04,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:04,331 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 96 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:04,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 789 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 05:41:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 05:41:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 338 states have (on average 1.319526627218935) internal successors, (446), 338 states have internal predecessors, (446), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 524 transitions. [2025-03-17 05:41:04,385 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 524 transitions. Word has length 109 [2025-03-17 05:41:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:04,386 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 524 transitions. [2025-03-17 05:41:04,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 524 transitions. [2025-03-17 05:41:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:41:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:04,388 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:41:04,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 867880373, now seen corresponding path program 1 times [2025-03-17 05:41:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968935858] [2025-03-17 05:41:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:04,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:41:04,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:41:04,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:04,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968935858] [2025-03-17 05:41:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968935858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:04,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:41:04,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311479530] [2025-03-17 05:41:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:41:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:04,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:41:04,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:04,770 INFO L87 Difference]: Start difference. First operand 385 states and 524 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:05,073 INFO L93 Difference]: Finished difference Result 678 states and 921 transitions. [2025-03-17 05:41:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:41:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-17 05:41:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:05,075 INFO L225 Difference]: With dead ends: 678 [2025-03-17 05:41:05,075 INFO L226 Difference]: Without dead ends: 393 [2025-03-17 05:41:05,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:41:05,076 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 307 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:05,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 559 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-17 05:41:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-17 05:41:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 344 states have (on average 1.308139534883721) internal successors, (450), 344 states have internal predecessors, (450), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 528 transitions. [2025-03-17 05:41:05,132 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 528 transitions. Word has length 109 [2025-03-17 05:41:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:05,133 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 528 transitions. [2025-03-17 05:41:05,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 528 transitions. [2025-03-17 05:41:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:41:05,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:05,135 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:05,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:41:05,135 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:05,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1755384054, now seen corresponding path program 1 times [2025-03-17 05:41:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57361128] [2025-03-17 05:41:05,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:05,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:41:05,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:41:05,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57361128] [2025-03-17 05:41:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57361128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908624278] [2025-03-17 05:41:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:05,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:05,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:05,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:05,277 INFO L87 Difference]: Start difference. First operand 393 states and 528 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:05,420 INFO L93 Difference]: Finished difference Result 686 states and 923 transitions. [2025-03-17 05:41:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:05,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-17 05:41:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:05,423 INFO L225 Difference]: With dead ends: 686 [2025-03-17 05:41:05,423 INFO L226 Difference]: Without dead ends: 393 [2025-03-17 05:41:05,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:05,425 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:05,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 473 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-17 05:41:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-17 05:41:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 344 states have (on average 1.302325581395349) internal successors, (448), 344 states have internal predecessors, (448), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 526 transitions. [2025-03-17 05:41:05,505 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 526 transitions. Word has length 109 [2025-03-17 05:41:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:05,505 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 526 transitions. [2025-03-17 05:41:05,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 526 transitions. [2025-03-17 05:41:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:41:05,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:05,507 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:05,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:41:05,507 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:05,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -52070409, now seen corresponding path program 1 times [2025-03-17 05:41:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:05,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478104312] [2025-03-17 05:41:05,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:05,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:41:05,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:41:05,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:41:05,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478104312] [2025-03-17 05:41:05,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478104312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000066245] [2025-03-17 05:41:05,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:05,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:05,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:05,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:41:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:41:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:41:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:05,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:05,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:41:05,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:05,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000066245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:05,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:41:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607920075] [2025-03-17 05:41:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:05,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:05,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:05,796 INFO L87 Difference]: Start difference. First operand 393 states and 526 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:05,850 INFO L93 Difference]: Finished difference Result 692 states and 927 transitions. [2025-03-17 05:41:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:05,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-17 05:41:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:05,852 INFO L225 Difference]: With dead ends: 692 [2025-03-17 05:41:05,852 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 05:41:05,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:05,853 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 05:41:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-17 05:41:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 350 states have (on average 1.2971428571428572) internal successors, (454), 350 states have internal predecessors, (454), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 532 transitions. [2025-03-17 05:41:05,892 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 532 transitions. Word has length 109 [2025-03-17 05:41:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:05,892 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 532 transitions. [2025-03-17 05:41:05,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 532 transitions. [2025-03-17 05:41:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:41:05,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:05,893 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:05,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:06,099 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1701001327, now seen corresponding path program 1 times [2025-03-17 05:41:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822553505] [2025-03-17 05:41:06,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:06,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:41:06,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:41:06,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:06,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:41:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822553505] [2025-03-17 05:41:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822553505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297048740] [2025-03-17 05:41:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:06,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:41:06,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:41:06,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:41:06,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:06,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:06,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:41:06,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:06,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297048740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:41:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520678707] [2025-03-17 05:41:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:41:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:41:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:06,374 INFO L87 Difference]: Start difference. First operand 399 states and 532 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:06,429 INFO L93 Difference]: Finished difference Result 706 states and 941 transitions. [2025-03-17 05:41:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 112 [2025-03-17 05:41:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:06,431 INFO L225 Difference]: With dead ends: 706 [2025-03-17 05:41:06,431 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 05:41:06,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:06,432 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:06,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 05:41:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 401. [2025-03-17 05:41:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 352 states have (on average 1.2954545454545454) internal successors, (456), 352 states have internal predecessors, (456), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 534 transitions. [2025-03-17 05:41:06,472 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 534 transitions. Word has length 112 [2025-03-17 05:41:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 534 transitions. [2025-03-17 05:41:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 534 transitions. [2025-03-17 05:41:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:41:06,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:06,473 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:06,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:41:06,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 05:41:06,674 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:06,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -890259074, now seen corresponding path program 1 times [2025-03-17 05:41:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814419220] [2025-03-17 05:41:06,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:41:06,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:41:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814419220] [2025-03-17 05:41:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814419220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:41:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33855339] [2025-03-17 05:41:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:41:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:07,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:41:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:07,143 INFO L87 Difference]: Start difference. First operand 401 states and 534 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:41:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:07,444 INFO L93 Difference]: Finished difference Result 706 states and 939 transitions. [2025-03-17 05:41:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-17 05:41:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:07,447 INFO L225 Difference]: With dead ends: 706 [2025-03-17 05:41:07,448 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 05:41:07,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:41:07,452 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 121 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:07,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 627 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 05:41:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2025-03-17 05:41:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 352 states have (on average 1.2926136363636365) internal successors, (455), 352 states have internal predecessors, (455), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 533 transitions. [2025-03-17 05:41:07,509 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 533 transitions. Word has length 114 [2025-03-17 05:41:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 533 transitions. [2025-03-17 05:41:07,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:41:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 533 transitions. [2025-03-17 05:41:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:41:07,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:07,511 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:41:07,511 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1812057146, now seen corresponding path program 1 times [2025-03-17 05:41:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059679534] [2025-03-17 05:41:07,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:41:07,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:41:07,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:07,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059679534] [2025-03-17 05:41:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059679534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:41:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747754056] [2025-03-17 05:41:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:41:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:07,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:41:07,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:41:07,822 INFO L87 Difference]: Start difference. First operand 401 states and 533 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:08,124 INFO L93 Difference]: Finished difference Result 727 states and 959 transitions. [2025-03-17 05:41:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:41:08,125 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-03-17 05:41:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:08,127 INFO L225 Difference]: With dead ends: 727 [2025-03-17 05:41:08,127 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 05:41:08,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:41:08,128 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 251 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:08,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 469 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 05:41:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 401. [2025-03-17 05:41:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 352 states have (on average 1.2869318181818181) internal successors, (453), 352 states have internal predecessors, (453), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 531 transitions. [2025-03-17 05:41:08,165 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 531 transitions. Word has length 118 [2025-03-17 05:41:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:08,165 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 531 transitions. [2025-03-17 05:41:08,165 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 531 transitions. [2025-03-17 05:41:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:41:08,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:08,166 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:08,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:41:08,166 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1631296897, now seen corresponding path program 1 times [2025-03-17 05:41:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150032366] [2025-03-17 05:41:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:08,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:41:08,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:41:08,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:08,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150032366] [2025-03-17 05:41:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150032366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:41:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450079503] [2025-03-17 05:41:08,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:41:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:08,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:41:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:08,408 INFO L87 Difference]: Start difference. First operand 401 states and 531 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:08,680 INFO L93 Difference]: Finished difference Result 702 states and 929 transitions. [2025-03-17 05:41:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:41:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2025-03-17 05:41:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:08,682 INFO L225 Difference]: With dead ends: 702 [2025-03-17 05:41:08,682 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 05:41:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:08,684 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 282 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:08,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 473 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 05:41:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-17 05:41:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 352 states have (on average 1.28125) internal successors, (451), 352 states have internal predecessors, (451), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 529 transitions. [2025-03-17 05:41:08,737 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 529 transitions. Word has length 119 [2025-03-17 05:41:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:08,737 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 529 transitions. [2025-03-17 05:41:08,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 529 transitions. [2025-03-17 05:41:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:41:08,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:08,738 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:41:08,738 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2118860603, now seen corresponding path program 1 times [2025-03-17 05:41:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755661535] [2025-03-17 05:41:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:41:08,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:41:08,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:08,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755661535] [2025-03-17 05:41:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755661535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:41:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752818810] [2025-03-17 05:41:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:41:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:09,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:41:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:41:09,076 INFO L87 Difference]: Start difference. First operand 401 states and 529 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:09,329 INFO L93 Difference]: Finished difference Result 702 states and 925 transitions. [2025-03-17 05:41:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:41:09,329 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 120 [2025-03-17 05:41:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:09,331 INFO L225 Difference]: With dead ends: 702 [2025-03-17 05:41:09,331 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 05:41:09,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:09,332 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 278 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:09,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 595 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 05:41:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-17 05:41:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 352 states have (on average 1.2755681818181819) internal successors, (449), 352 states have internal predecessors, (449), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 527 transitions. [2025-03-17 05:41:09,369 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 527 transitions. Word has length 120 [2025-03-17 05:41:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:09,369 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 527 transitions. [2025-03-17 05:41:09,370 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 527 transitions. [2025-03-17 05:41:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:41:09,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:09,370 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:41:09,371 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash 734817960, now seen corresponding path program 1 times [2025-03-17 05:41:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822230284] [2025-03-17 05:41:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:41:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:41:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822230284] [2025-03-17 05:41:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822230284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:09,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:41:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866506580] [2025-03-17 05:41:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:41:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:09,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:41:09,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:41:09,994 INFO L87 Difference]: Start difference. First operand 401 states and 527 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:41:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:10,730 INFO L93 Difference]: Finished difference Result 1053 states and 1366 transitions. [2025-03-17 05:41:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:41:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 122 [2025-03-17 05:41:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:10,733 INFO L225 Difference]: With dead ends: 1053 [2025-03-17 05:41:10,733 INFO L226 Difference]: Without dead ends: 752 [2025-03-17 05:41:10,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:41:10,734 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 160 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:10,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1390 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:41:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-17 05:41:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 673. [2025-03-17 05:41:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 592 states have (on average 1.25) internal successors, (740), 592 states have internal predecessors, (740), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 870 transitions. [2025-03-17 05:41:10,791 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 870 transitions. Word has length 122 [2025-03-17 05:41:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:10,791 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 870 transitions. [2025-03-17 05:41:10,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-17 05:41:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 870 transitions. [2025-03-17 05:41:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:41:10,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:10,792 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:41:10,792 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1749915180, now seen corresponding path program 1 times [2025-03-17 05:41:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101139648] [2025-03-17 05:41:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:10,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:41:10,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:41:10,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:10,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101139648] [2025-03-17 05:41:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101139648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483866429] [2025-03-17 05:41:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:10,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:10,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:10,954 INFO L87 Difference]: Start difference. First operand 673 states and 870 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:11,130 INFO L93 Difference]: Finished difference Result 1118 states and 1436 transitions. [2025-03-17 05:41:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 125 [2025-03-17 05:41:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:11,134 INFO L225 Difference]: With dead ends: 1118 [2025-03-17 05:41:11,134 INFO L226 Difference]: Without dead ends: 816 [2025-03-17 05:41:11,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:11,136 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 54 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:11,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 618 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-17 05:41:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 733. [2025-03-17 05:41:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 652 states have (on average 1.2484662576687116) internal successors, (814), 652 states have internal predecessors, (814), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 944 transitions. [2025-03-17 05:41:11,196 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 944 transitions. Word has length 125 [2025-03-17 05:41:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:11,196 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 944 transitions. [2025-03-17 05:41:11,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 944 transitions. [2025-03-17 05:41:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:41:11,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:11,197 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:11,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:41:11,197 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -454952110, now seen corresponding path program 1 times [2025-03-17 05:41:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879814594] [2025-03-17 05:41:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:11,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:41:11,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:41:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879814594] [2025-03-17 05:41:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879814594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698395358] [2025-03-17 05:41:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:11,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:11,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:11,310 INFO L87 Difference]: Start difference. First operand 733 states and 944 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:11,559 INFO L93 Difference]: Finished difference Result 1249 states and 1607 transitions. [2025-03-17 05:41:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:11,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2025-03-17 05:41:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:11,562 INFO L225 Difference]: With dead ends: 1249 [2025-03-17 05:41:11,562 INFO L226 Difference]: Without dead ends: 894 [2025-03-17 05:41:11,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:11,563 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 61 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:11,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 622 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-17 05:41:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 751. [2025-03-17 05:41:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 670 states have (on average 1.2597014925373133) internal successors, (844), 670 states have internal predecessors, (844), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 974 transitions. [2025-03-17 05:41:11,658 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 974 transitions. Word has length 128 [2025-03-17 05:41:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 974 transitions. [2025-03-17 05:41:11,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 974 transitions. [2025-03-17 05:41:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:41:11,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:11,660 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:11,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:41:11,660 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash -622844771, now seen corresponding path program 1 times [2025-03-17 05:41:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731843748] [2025-03-17 05:41:11,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:41:11,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:41:11,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:11,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731843748] [2025-03-17 05:41:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731843748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416444037] [2025-03-17 05:41:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:11,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:11,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:11,788 INFO L87 Difference]: Start difference. First operand 751 states and 974 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:11,963 INFO L93 Difference]: Finished difference Result 1281 states and 1659 transitions. [2025-03-17 05:41:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:11,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2025-03-17 05:41:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:11,972 INFO L225 Difference]: With dead ends: 1281 [2025-03-17 05:41:11,972 INFO L226 Difference]: Without dead ends: 912 [2025-03-17 05:41:11,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:11,973 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 61 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:11,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 635 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-17 05:41:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 751. [2025-03-17 05:41:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 670 states have (on average 1.2597014925373133) internal successors, (844), 670 states have internal predecessors, (844), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 974 transitions. [2025-03-17 05:41:12,101 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 974 transitions. Word has length 129 [2025-03-17 05:41:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 974 transitions. [2025-03-17 05:41:12,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 974 transitions. [2025-03-17 05:41:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:41:12,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:12,107 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:41:12,107 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1427329480, now seen corresponding path program 1 times [2025-03-17 05:41:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158281261] [2025-03-17 05:41:12,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:12,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:41:12,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:41:12,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:12,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158281261] [2025-03-17 05:41:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158281261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:41:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368147134] [2025-03-17 05:41:12,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:12,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:41:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:12,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:41:12,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:41:12,529 INFO L87 Difference]: Start difference. First operand 751 states and 974 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:12,867 INFO L93 Difference]: Finished difference Result 1123 states and 1453 transitions. [2025-03-17 05:41:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:41:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 130 [2025-03-17 05:41:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:12,871 INFO L225 Difference]: With dead ends: 1123 [2025-03-17 05:41:12,871 INFO L226 Difference]: Without dead ends: 733 [2025-03-17 05:41:12,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:12,872 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 223 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:12,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 521 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-17 05:41:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2025-03-17 05:41:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 652 states have (on average 1.2208588957055215) internal successors, (796), 652 states have internal predecessors, (796), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 926 transitions. [2025-03-17 05:41:12,960 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 926 transitions. Word has length 130 [2025-03-17 05:41:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:12,960 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 926 transitions. [2025-03-17 05:41:12,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 926 transitions. [2025-03-17 05:41:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:41:12,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:12,962 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:41:12,962 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -398781627, now seen corresponding path program 1 times [2025-03-17 05:41:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927756780] [2025-03-17 05:41:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:12,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:41:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:41:13,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:13,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:41:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927756780] [2025-03-17 05:41:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927756780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:13,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:41:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418266853] [2025-03-17 05:41:13,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:13,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:41:13,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:13,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:41:13,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:41:13,832 INFO L87 Difference]: Start difference. First operand 733 states and 926 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:14,489 INFO L93 Difference]: Finished difference Result 1550 states and 1904 transitions. [2025-03-17 05:41:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 05:41:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 132 [2025-03-17 05:41:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:14,493 INFO L225 Difference]: With dead ends: 1550 [2025-03-17 05:41:14,493 INFO L226 Difference]: Without dead ends: 1200 [2025-03-17 05:41:14,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:41:14,495 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 190 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:14,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2285 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:41:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-03-17 05:41:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 798. [2025-03-17 05:41:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 717 states have (on average 1.2231520223152021) internal successors, (877), 717 states have internal predecessors, (877), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1007 transitions. [2025-03-17 05:41:14,568 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1007 transitions. Word has length 132 [2025-03-17 05:41:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1007 transitions. [2025-03-17 05:41:14,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1007 transitions. [2025-03-17 05:41:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 05:41:14,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:14,570 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:41:14,571 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 947768382, now seen corresponding path program 1 times [2025-03-17 05:41:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113613087] [2025-03-17 05:41:14,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 05:41:14,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 05:41:14,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 05:41:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113613087] [2025-03-17 05:41:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113613087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500252618] [2025-03-17 05:41:16,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:16,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:16,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:16,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:41:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 05:41:16,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 05:41:16,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:16,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:16,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 05:41:16,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:41:17,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:41:18,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 05:41:18,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-03-17 05:41:18,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:18,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-17 05:41:19,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2025-03-17 05:41:20,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2025-03-17 05:41:20,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2025-03-17 05:41:20,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2025-03-17 05:41:20,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-03-17 05:41:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2025-03-17 05:41:20,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:20,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 61 [2025-03-17 05:41:20,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2025-03-17 05:41:20,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:20,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2025-03-17 05:41:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 15 proven. 990 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-17 05:41:20,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:21,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2025-03-17 05:41:21,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:21,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2025-03-17 05:41:21,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 226 [2025-03-17 05:41:21,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 216 [2025-03-17 05:41:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500252618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:22,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-03-17 05:41:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685590345] [2025-03-17 05:41:22,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:41:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:22,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:41:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:41:22,167 INFO L87 Difference]: Start difference. First operand 798 states and 1007 transitions. Second operand has 21 states, 20 states have (on average 7.95) internal successors, (159), 21 states have internal predecessors, (159), 7 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2025-03-17 05:41:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:26,455 INFO L93 Difference]: Finished difference Result 1795 states and 2262 transitions. [2025-03-17 05:41:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 05:41:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 21 states have internal predecessors, (159), 7 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) Word has length 215 [2025-03-17 05:41:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:26,460 INFO L225 Difference]: With dead ends: 1795 [2025-03-17 05:41:26,460 INFO L226 Difference]: Without dead ends: 1443 [2025-03-17 05:41:26,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 05:41:26,463 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1084 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:26,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1744 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 05:41:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-17 05:41:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 782. [2025-03-17 05:41:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 701 states have (on average 1.2082738944365192) internal successors, (847), 701 states have internal predecessors, (847), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 977 transitions. [2025-03-17 05:41:26,563 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 977 transitions. Word has length 215 [2025-03-17 05:41:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:26,563 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 977 transitions. [2025-03-17 05:41:26,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 21 states have internal predecessors, (159), 7 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2025-03-17 05:41:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 977 transitions. [2025-03-17 05:41:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-17 05:41:26,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:26,566 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:26,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:41:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-17 05:41:26,767 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 838280640, now seen corresponding path program 1 times [2025-03-17 05:41:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118223564] [2025-03-17 05:41:26,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 05:41:26,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 05:41:26,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:26,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2025-03-17 05:41:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:26,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118223564] [2025-03-17 05:41:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118223564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:26,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:26,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:41:26,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322919082] [2025-03-17 05:41:26,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:26,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:41:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:26,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:41:26,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:41:26,857 INFO L87 Difference]: Start difference. First operand 782 states and 977 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:26,953 INFO L93 Difference]: Finished difference Result 1629 states and 2038 transitions. [2025-03-17 05:41:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:41:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2025-03-17 05:41:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:26,957 INFO L225 Difference]: With dead ends: 1629 [2025-03-17 05:41:26,957 INFO L226 Difference]: Without dead ends: 969 [2025-03-17 05:41:26,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:41:26,958 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 64 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:26,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 376 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-17 05:41:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 794. [2025-03-17 05:41:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 713 states have (on average 1.2047685834502104) internal successors, (859), 713 states have internal predecessors, (859), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 989 transitions. [2025-03-17 05:41:27,034 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 989 transitions. Word has length 217 [2025-03-17 05:41:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:27,034 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 989 transitions. [2025-03-17 05:41:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 989 transitions. [2025-03-17 05:41:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 05:41:27,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:27,036 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:41:27,036 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:27,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 631253278, now seen corresponding path program 1 times [2025-03-17 05:41:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834905715] [2025-03-17 05:41:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:27,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:27,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:27,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 1316 trivial. 0 not checked. [2025-03-17 05:41:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834905715] [2025-03-17 05:41:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834905715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500501970] [2025-03-17 05:41:28,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:28,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:28,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:28,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:41:28,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:28,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:28,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:28,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:28,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 05:41:28,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:29,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:41:29,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:41:29,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2025-03-17 05:41:29,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:29,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 05:41:29,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:29,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-03-17 05:41:30,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:30,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2025-03-17 05:41:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 9 proven. 447 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2025-03-17 05:41:30,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:30,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 295 [2025-03-17 05:41:30,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:30,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:31,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:32,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:32,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-17 05:41:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2025-03-17 05:41:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500501970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:41:32,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:41:32,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2025-03-17 05:41:32,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501204688] [2025-03-17 05:41:32,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 05:41:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:32,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 05:41:32,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:41:32,048 INFO L87 Difference]: Start difference. First operand 794 states and 989 transitions. Second operand has 28 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 28 states have internal predecessors, (209), 6 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) [2025-03-17 05:41:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:33,363 INFO L93 Difference]: Finished difference Result 1558 states and 1947 transitions. [2025-03-17 05:41:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:41:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 28 states have internal predecessors, (209), 6 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) Word has length 219 [2025-03-17 05:41:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:33,366 INFO L225 Difference]: With dead ends: 1558 [2025-03-17 05:41:33,367 INFO L226 Difference]: Without dead ends: 1098 [2025-03-17 05:41:33,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 357 SyntacticMatches, 69 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:41:33,368 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 374 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:33,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 2389 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1053 Invalid, 5 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:41:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-17 05:41:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 928. [2025-03-17 05:41:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 847 states have (on average 1.217237308146399) internal successors, (1031), 847 states have internal predecessors, (1031), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1161 transitions. [2025-03-17 05:41:33,447 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1161 transitions. Word has length 219 [2025-03-17 05:41:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:33,447 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1161 transitions. [2025-03-17 05:41:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 28 states have internal predecessors, (209), 6 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) [2025-03-17 05:41:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1161 transitions. [2025-03-17 05:41:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 05:41:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:33,449 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:33,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:33,650 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2138805087, now seen corresponding path program 1 times [2025-03-17 05:41:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706378825] [2025-03-17 05:41:33,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:33,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:33,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:33,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:33,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2025-03-17 05:41:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:34,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706378825] [2025-03-17 05:41:34,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706378825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:34,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466829555] [2025-03-17 05:41:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:34,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:34,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:34,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:41:34,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:34,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:34,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:41:34,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:36,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:41:36,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2025-03-17 05:41:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2025-03-17 05:41:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2025-03-17 05:41:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:36,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:36,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 36 [2025-03-17 05:41:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 12 proven. 444 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2025-03-17 05:41:36,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466829555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:37,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2025-03-17 05:41:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212302382] [2025-03-17 05:41:37,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:41:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:41:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=271, Unknown=2, NotChecked=0, Total=342 [2025-03-17 05:41:37,372 INFO L87 Difference]: Start difference. First operand 928 states and 1161 transitions. Second operand has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 05:41:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:38,081 INFO L93 Difference]: Finished difference Result 1660 states and 2079 transitions. [2025-03-17 05:41:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:41:38,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 219 [2025-03-17 05:41:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:38,085 INFO L225 Difference]: With dead ends: 1660 [2025-03-17 05:41:38,086 INFO L226 Difference]: Without dead ends: 1066 [2025-03-17 05:41:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=483, Unknown=2, NotChecked=0, Total=650 [2025-03-17 05:41:38,087 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 560 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:38,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1134 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:41:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-17 05:41:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 928. [2025-03-17 05:41:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 847 states have (on average 1.2125147579693034) internal successors, (1027), 847 states have internal predecessors, (1027), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1157 transitions. [2025-03-17 05:41:38,182 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1157 transitions. Word has length 219 [2025-03-17 05:41:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1157 transitions. [2025-03-17 05:41:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 05:41:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1157 transitions. [2025-03-17 05:41:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 05:41:38,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:38,184 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:38,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:41:38,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:38,384 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:38,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 642569405, now seen corresponding path program 1 times [2025-03-17 05:41:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:38,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912569367] [2025-03-17 05:41:38,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:38,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:38,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:38,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2025-03-17 05:41:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912569367] [2025-03-17 05:41:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912569367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506098246] [2025-03-17 05:41:39,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:39,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:39,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:41:39,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:39,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:39,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:39,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:41:39,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:41,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:41:41,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2025-03-17 05:41:41,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:41,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:41,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2025-03-17 05:41:41,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:41,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2025-03-17 05:41:41,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:41,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:41,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:41,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 36 [2025-03-17 05:41:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 12 proven. 444 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2025-03-17 05:41:41,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:41,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1264 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (< 0 (+ .cse0 1)) (< (+ 128 .cse0) 0) (let ((.cse1 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1264))) (< (+ 3 (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (not (= (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse0) v_ArrVal_1264))))) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1264 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (let ((.cse3 (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1264))) (< (+ 3 (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (< 127 .cse4) (< .cse4 0) (not (= (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse4) v_ArrVal_1264))))))) is different from false [2025-03-17 05:41:41,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506098246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:41,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-03-17 05:41:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86053669] [2025-03-17 05:41:41,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:41:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:41,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:41:41,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=216, Unknown=1, NotChecked=30, Total=306 [2025-03-17 05:41:41,974 INFO L87 Difference]: Start difference. First operand 928 states and 1157 transitions. Second operand has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 05:41:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:42,579 INFO L93 Difference]: Finished difference Result 1660 states and 2071 transitions. [2025-03-17 05:41:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:41:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 219 [2025-03-17 05:41:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:42,583 INFO L225 Difference]: With dead ends: 1660 [2025-03-17 05:41:42,583 INFO L226 Difference]: Without dead ends: 1066 [2025-03-17 05:41:42,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=374, Unknown=1, NotChecked=42, Total=552 [2025-03-17 05:41:42,584 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 356 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:42,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1114 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:41:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-17 05:41:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 928. [2025-03-17 05:41:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 847 states have (on average 1.2077922077922079) internal successors, (1023), 847 states have internal predecessors, (1023), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1153 transitions. [2025-03-17 05:41:42,703 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1153 transitions. Word has length 219 [2025-03-17 05:41:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1153 transitions. [2025-03-17 05:41:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 5 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 05:41:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1153 transitions. [2025-03-17 05:41:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 05:41:42,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:42,707 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:42,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 05:41:42,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-17 05:41:42,908 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2144846082, now seen corresponding path program 1 times [2025-03-17 05:41:42,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230253260] [2025-03-17 05:41:42,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:42,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2025-03-17 05:41:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230253260] [2025-03-17 05:41:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230253260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314032517] [2025-03-17 05:41:45,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:45,005 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:45,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 05:41:45,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 05:41:45,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 05:41:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:45,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 05:41:45,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:46,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:41:46,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2025-03-17 05:41:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:46,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 05:41:46,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2025-03-17 05:41:46,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:46,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 65 [2025-03-17 05:41:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 9 proven. 447 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2025-03-17 05:41:46,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2025-03-17 05:41:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314032517] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:47,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:47,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20, 13] total 33 [2025-03-17 05:41:47,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220819253] [2025-03-17 05:41:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:47,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:41:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:47,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:41:47,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:41:47,242 INFO L87 Difference]: Start difference. First operand 928 states and 1153 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:47,720 INFO L93 Difference]: Finished difference Result 1668 states and 2071 transitions. [2025-03-17 05:41:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:41:47,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 219 [2025-03-17 05:41:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:47,724 INFO L225 Difference]: With dead ends: 1668 [2025-03-17 05:41:47,724 INFO L226 Difference]: Without dead ends: 1074 [2025-03-17 05:41:47,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=1290, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:41:47,726 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 89 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1443 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-03-17 05:41:47,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1443 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-03-17 05:41:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 908. [2025-03-17 05:41:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 827 states have (on average 1.2079806529625152) internal successors, (999), 827 states have internal predecessors, (999), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1129 transitions. [2025-03-17 05:41:47,819 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1129 transitions. Word has length 219 [2025-03-17 05:41:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1129 transitions. [2025-03-17 05:41:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1129 transitions. [2025-03-17 05:41:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 05:41:47,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:47,821 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:47,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 05:41:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:48,022 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:48,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -867867406, now seen corresponding path program 1 times [2025-03-17 05:41:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542423685] [2025-03-17 05:41:48,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 05:41:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 05:41:48,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:48,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2025-03-17 05:41:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542423685] [2025-03-17 05:41:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542423685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:41:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185305088] [2025-03-17 05:41:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:48,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:41:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:48,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:41:48,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:41:48,117 INFO L87 Difference]: Start difference. First operand 908 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:48,262 INFO L93 Difference]: Finished difference Result 1588 states and 1973 transitions. [2025-03-17 05:41:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:41:48,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 224 [2025-03-17 05:41:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:48,265 INFO L225 Difference]: With dead ends: 1588 [2025-03-17 05:41:48,265 INFO L226 Difference]: Without dead ends: 1014 [2025-03-17 05:41:48,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:41:48,266 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 68 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:48,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-17 05:41:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 908. [2025-03-17 05:41:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 827 states have (on average 1.1983071342200726) internal successors, (991), 827 states have internal predecessors, (991), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:41:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1121 transitions. [2025-03-17 05:41:48,349 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1121 transitions. Word has length 224 [2025-03-17 05:41:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1121 transitions. [2025-03-17 05:41:48,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 05:41:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1121 transitions. [2025-03-17 05:41:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-17 05:41:48,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:48,351 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 05:41:48,351 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:48,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash 379958544, now seen corresponding path program 1 times [2025-03-17 05:41:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531529176] [2025-03-17 05:41:48,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 05:41:48,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 05:41:48,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:48,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 58 proven. 69 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-03-17 05:41:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531529176] [2025-03-17 05:41:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531529176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135074144] [2025-03-17 05:41:49,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:49,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:49,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:41:49,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 05:41:49,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 05:41:49,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 05:41:49,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:41:49,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:49,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:41:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:50,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:41:50,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:41:50,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2025-03-17 05:41:50,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2025-03-17 05:41:50,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:50,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2025-03-17 05:41:50,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:50,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 71 [2025-03-17 05:41:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 172 proven. 654 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-17 05:41:50,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135074144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:50,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:50,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 05:41:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768913949] [2025-03-17 05:41:50,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:41:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:50,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:41:50,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:41:50,949 INFO L87 Difference]: Start difference. First operand 908 states and 1121 transitions. Second operand has 17 states, 15 states have (on average 12.8) internal successors, (192), 17 states have internal predecessors, (192), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2025-03-17 05:41:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:51,561 INFO L93 Difference]: Finished difference Result 1806 states and 2209 transitions. [2025-03-17 05:41:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:41:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 12.8) internal successors, (192), 17 states have internal predecessors, (192), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) Word has length 226 [2025-03-17 05:41:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:51,566 INFO L225 Difference]: With dead ends: 1806 [2025-03-17 05:41:51,566 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 05:41:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:41:51,568 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 454 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:51,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 693 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:41:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 05:41:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 504. [2025-03-17 05:41:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 452 states have (on average 1.1858407079646018) internal successors, (536), 452 states have internal predecessors, (536), 39 states have call successors, (39), 12 states have call predecessors, (39), 12 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:41:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 614 transitions. [2025-03-17 05:41:51,641 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 614 transitions. Word has length 226 [2025-03-17 05:41:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:51,641 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 614 transitions. [2025-03-17 05:41:51,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 12.8) internal successors, (192), 17 states have internal predecessors, (192), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2025-03-17 05:41:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 614 transitions. [2025-03-17 05:41:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 05:41:51,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:51,642 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:41:51,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 05:41:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-17 05:41:51,843 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1584213395, now seen corresponding path program 1 times [2025-03-17 05:41:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137869654] [2025-03-17 05:41:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.