./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:37:17,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:37:17,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:37:17,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:37:17,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:37:17,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:37:17,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:37:17,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:37:17,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:37:17,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:37:17,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:37:17,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:37:17,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:37:17,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:37:17,954 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:37:17,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:37:17,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:37:17,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:37:17,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:37:17,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:37:17,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:17,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:17,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:17,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:37:17,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:17,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:17,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:37:17,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1d83a7aa7482f86e6852a22c01d45006c9d5171e3bfe65b1880a039304a6026 [2025-01-09 15:37:18,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:37:18,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:37:18,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:37:18,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:37:18,240 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:37:18,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-01-09 15:37:19,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90cdee662/853cd959779b4089ae699b8847c331f9/FLAGa41d5e112 [2025-01-09 15:37:19,629 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:37:19,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i [2025-01-09 15:37:19,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90cdee662/853cd959779b4089ae699b8847c331f9/FLAGa41d5e112 [2025-01-09 15:37:19,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90cdee662/853cd959779b4089ae699b8847c331f9 [2025-01-09 15:37:19,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:37:19,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:37:19,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:19,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:37:19,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:37:19,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:19" (1/1) ... [2025-01-09 15:37:19,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:19, skipping insertion in model container [2025-01-09 15:37:19,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:19" (1/1) ... [2025-01-09 15:37:19,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:37:20,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i[917,930] [2025-01-09 15:37:20,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:20,152 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:37:20,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-66.i[917,930] [2025-01-09 15:37:20,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:20,205 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:37:20,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20 WrapperNode [2025-01-09 15:37:20,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:20,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:20,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:37:20,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:37:20,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,255 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-01-09 15:37:20,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:20,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:37:20,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:37:20,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:37:20,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,293 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2025-01-09 15:37:20,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:37:20,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:37:20,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:37:20,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:37:20,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (1/1) ... [2025-01-09 15:37:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:20,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:20,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:37:20,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:37:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:37:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:37:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:37:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:37:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:37:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:37:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:37:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:37:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:37:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:37:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:37:20,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:37:20,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:37:20,886 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:37:20,887 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:37:20,894 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:37:20,895 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:37:20,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:20 BoogieIcfgContainer [2025-01-09 15:37:20,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:37:20,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:37:20,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:37:20,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:37:20,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:37:19" (1/3) ... [2025-01-09 15:37:20,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7ea678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:20, skipping insertion in model container [2025-01-09 15:37:20,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:20" (2/3) ... [2025-01-09 15:37:20,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7ea678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:20, skipping insertion in model container [2025-01-09 15:37:20,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:20" (3/3) ... [2025-01-09 15:37:20,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-66.i [2025-01-09 15:37:20,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:37:20,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:37:20,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:37:20,988 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;@7388a940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:37:20,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:37:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:37:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:21,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:21,004 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:21,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:21,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1738331553, now seen corresponding path program 1 times [2025-01-09 15:37:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555910161] [2025-01-09 15:37:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:21,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:21,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:21,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:21,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:37:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555910161] [2025-01-09 15:37:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555910161] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939756607] [2025-01-09 15:37:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:21,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:21,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:37:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:37:21,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:21,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:21,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:21,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:37:21,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:37:21,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939756607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:37:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:37:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477010286] [2025-01-09 15:37:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:21,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:37:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:21,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:37:21,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:37:21,384 INFO L87 Difference]: Start difference. First operand has 85 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:21,398 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-01-09 15:37:21,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:37:21,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-01-09 15:37:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:21,403 INFO L225 Difference]: With dead ends: 164 [2025-01-09 15:37:21,403 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 15:37:21,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-01-09 15:37:21,406 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 15:37:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 15:37:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:37:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-01-09 15:37:21,439 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-01-09 15:37:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-01-09 15:37:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-01-09 15:37:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:21,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:21,441 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:21,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:37:21,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:37:21,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1756194437, now seen corresponding path program 1 times [2025-01-09 15:37:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:21,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385695461] [2025-01-09 15:37:21,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:21,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:21,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:21,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:21,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385695461] [2025-01-09 15:37:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385695461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:37:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866132677] [2025-01-09 15:37:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:21,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:37:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:21,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:37:21,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:37:21,997 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:22,047 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-01-09 15:37:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:37:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:37:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:22,049 INFO L225 Difference]: With dead ends: 164 [2025-01-09 15:37:22,049 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 15:37:22,050 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-01-09 15:37:22,050 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:22,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 15:37:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-01-09 15:37:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:37:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-01-09 15:37:22,061 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-01-09 15:37:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-01-09 15:37:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-01-09 15:37:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:22,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:22,063 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:22,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:37:22,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1758041479, now seen corresponding path program 1 times [2025-01-09 15:37:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118428810] [2025-01-09 15:37:22,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:22,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:24,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118428810] [2025-01-09 15:37:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118428810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:24,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449446645] [2025-01-09 15:37:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:24,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:24,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:24,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:24,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:24,266 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:25,646 INFO L93 Difference]: Finished difference Result 390 states and 552 transitions. [2025-01-09 15:37:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:37:25,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-01-09 15:37:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:25,651 INFO L225 Difference]: With dead ends: 390 [2025-01-09 15:37:25,652 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 15:37:25,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:37:25,653 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 667 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:25,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 596 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:37:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 15:37:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 174. [2025-01-09 15:37:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 141 states have internal predecessors, (188), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:37:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 248 transitions. [2025-01-09 15:37:25,685 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 248 transitions. Word has length 109 [2025-01-09 15:37:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:25,685 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 248 transitions. [2025-01-09 15:37:25,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 248 transitions. [2025-01-09 15:37:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:25,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:25,687 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:25,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:37:25,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:25,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1171235465, now seen corresponding path program 1 times [2025-01-09 15:37:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-01-09 15:37:25,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:25,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:25,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:25,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-01-09 15:37:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805156854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:26,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992460508] [2025-01-09 15:37:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:26,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:26,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:26,140 INFO L87 Difference]: Start difference. First operand 174 states and 248 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:26,527 INFO L93 Difference]: Finished difference Result 463 states and 649 transitions. [2025-01-09 15:37:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:37:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:26,532 INFO L225 Difference]: With dead ends: 463 [2025-01-09 15:37:26,532 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 15:37:26,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:26,535 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 299 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:26,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 456 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 15:37:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 184. [2025-01-09 15:37:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 150 states have internal predecessors, (199), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:37:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2025-01-09 15:37:26,566 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 259 transitions. Word has length 109 [2025-01-09 15:37:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:26,566 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 259 transitions. [2025-01-09 15:37:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2025-01-09 15:37:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:26,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:26,569 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:26,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:37:26,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash 169693577, now seen corresponding path program 1 times [2025-01-09 15:37:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462658830] [2025-01-09 15:37:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:26,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:26,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:26,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:26,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462658830] [2025-01-09 15:37:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462658830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:37:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490493171] [2025-01-09 15:37:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:26,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:37:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:26,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:37:26,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:26,919 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:27,265 INFO L93 Difference]: Finished difference Result 354 states and 496 transitions. [2025-01-09 15:37:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:37:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:37:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:27,268 INFO L225 Difference]: With dead ends: 354 [2025-01-09 15:37:27,268 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 15:37:27,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:27,269 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 171 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:27,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 360 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 15:37:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 144. [2025-01-09 15:37:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:37:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2025-01-09 15:37:27,292 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 109 [2025-01-09 15:37:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:27,292 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2025-01-09 15:37:27,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2025-01-09 15:37:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:37:27,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:27,293 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:37:27,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -417112437, now seen corresponding path program 1 times [2025-01-09 15:37:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:27,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464409076] [2025-01-09 15:37:27,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:27,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:37:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:37:27,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:27,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464409076] [2025-01-09 15:37:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464409076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5374771] [2025-01-09 15:37:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:27,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:27,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:27,924 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:28,265 INFO L93 Difference]: Finished difference Result 296 states and 408 transitions. [2025-01-09 15:37:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-01-09 15:37:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:28,268 INFO L225 Difference]: With dead ends: 296 [2025-01-09 15:37:28,268 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 15:37:28,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:28,269 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 143 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:28,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 726 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 15:37:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-01-09 15:37:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 158 states have internal predecessors, (201), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2025-01-09 15:37:28,297 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 109 [2025-01-09 15:37:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:28,297 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2025-01-09 15:37:28,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2025-01-09 15:37:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:37:28,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:28,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:28,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:37:28,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -812000443, now seen corresponding path program 1 times [2025-01-09 15:37:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355291737] [2025-01-09 15:37:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:28,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:37:28,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:37:28,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:28,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355291737] [2025-01-09 15:37:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355291737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:29,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69111957] [2025-01-09 15:37:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:29,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:29,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:29,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:29,546 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,582 INFO L93 Difference]: Finished difference Result 437 states and 605 transitions. [2025-01-09 15:37:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:37:30,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-01-09 15:37:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,583 INFO L225 Difference]: With dead ends: 437 [2025-01-09 15:37:30,584 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 15:37:30,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:37:30,584 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 541 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 517 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:37:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 15:37:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 152. [2025-01-09 15:37:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 124 states have internal predecessors, (161), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2025-01-09 15:37:30,608 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 110 [2025-01-09 15:37:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,608 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2025-01-09 15:37:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2025-01-09 15:37:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:30,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,609 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:30,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:37:30,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2030126826, now seen corresponding path program 1 times [2025-01-09 15:37:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181400841] [2025-01-09 15:37:30,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:30,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:30,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181400841] [2025-01-09 15:37:30,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181400841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:30,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:37:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786260221] [2025-01-09 15:37:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:37:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:37:30,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:37:30,658 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,682 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2025-01-09 15:37:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:37:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-01-09 15:37:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,684 INFO L225 Difference]: With dead ends: 303 [2025-01-09 15:37:30,684 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:37:30,684 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-01-09 15:37:30,685 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:37:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-09 15:37:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.304) internal successors, (163), 126 states have internal predecessors, (163), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 211 transitions. [2025-01-09 15:37:30,705 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 211 transitions. Word has length 112 [2025-01-09 15:37:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,705 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 211 transitions. [2025-01-09 15:37:30,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 211 transitions. [2025-01-09 15:37:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:30,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,706 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:37:30,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1443320812, now seen corresponding path program 1 times [2025-01-09 15:37:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414569550] [2025-01-09 15:37:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:30,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:37:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414569550] [2025-01-09 15:37:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414569550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658022749] [2025-01-09 15:37:30,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:30,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:37:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:37:30,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:37:30,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:30,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658022749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:37:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:37:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729971043] [2025-01-09 15:37:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:30,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:30,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:30,984 INFO L87 Difference]: Start difference. First operand 154 states and 211 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:31,026 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2025-01-09 15:37:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-01-09 15:37:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:31,027 INFO L225 Difference]: With dead ends: 311 [2025-01-09 15:37:31,028 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 15:37:31,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 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-01-09 15:37:31,028 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:31,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 15:37:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 15:37:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 132 states have internal predecessors, (169), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2025-01-09 15:37:31,054 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 112 [2025-01-09 15:37:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:31,054 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2025-01-09 15:37:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2025-01-09 15:37:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:37:31,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:31,057 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:31,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:37:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:31,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1319297807, now seen corresponding path program 1 times [2025-01-09 15:37:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949894997] [2025-01-09 15:37:31,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:31,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:37:31,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:37:31,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:31,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:31,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:31,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949894997] [2025-01-09 15:37:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949894997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228004730] [2025-01-09 15:37:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:31,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:31,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:31,409 INFO L87 Difference]: Start difference. First operand 160 states and 217 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:31,525 INFO L93 Difference]: Finished difference Result 399 states and 545 transitions. [2025-01-09 15:37:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:31,525 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-01-09 15:37:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:31,527 INFO L225 Difference]: With dead ends: 399 [2025-01-09 15:37:31,527 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 15:37:31,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:31,527 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:31,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 333 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 15:37:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 180. [2025-01-09 15:37:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 152 states have internal predecessors, (196), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2025-01-09 15:37:31,550 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 244 transitions. Word has length 114 [2025-01-09 15:37:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 244 transitions. [2025-01-09 15:37:31,551 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 244 transitions. [2025-01-09 15:37:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:37:31,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:31,552 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:31,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:37:31,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1882448985, now seen corresponding path program 1 times [2025-01-09 15:37:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968920341] [2025-01-09 15:37:31,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:31,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:37:31,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:37:31,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:31,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968920341] [2025-01-09 15:37:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968920341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:31,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:37:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889401773] [2025-01-09 15:37:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:37:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:31,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:37:31,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:31,814 INFO L87 Difference]: Start difference. First operand 180 states and 244 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:31,920 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2025-01-09 15:37:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:37:31,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-01-09 15:37:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:31,921 INFO L225 Difference]: With dead ends: 504 [2025-01-09 15:37:31,922 INFO L226 Difference]: Without dead ends: 327 [2025-01-09 15:37:31,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:31,922 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:31,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 649 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-09 15:37:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2025-01-09 15:37:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 184 states have (on average 1.2880434782608696) internal successors, (237), 185 states have internal predecessors, (237), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2025-01-09 15:37:31,951 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 114 [2025-01-09 15:37:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:31,951 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2025-01-09 15:37:31,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2025-01-09 15:37:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:37:31,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:31,952 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:31,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:37:31,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 635663907, now seen corresponding path program 1 times [2025-01-09 15:37:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657863842] [2025-01-09 15:37:31,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:31,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:37:31,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:37:31,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:31,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657863842] [2025-01-09 15:37:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657863842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:37:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057413940] [2025-01-09 15:37:32,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:32,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:37:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:32,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:37:32,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:32,447 INFO L87 Difference]: Start difference. First operand 213 states and 285 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:33,000 INFO L93 Difference]: Finished difference Result 597 states and 793 transitions. [2025-01-09 15:37:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:37:33,001 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-01-09 15:37:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:33,003 INFO L225 Difference]: With dead ends: 597 [2025-01-09 15:37:33,003 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 15:37:33,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:37:33,006 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 267 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:33,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 628 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 15:37:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 301. [2025-01-09 15:37:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 272 states have (on average 1.3198529411764706) internal successors, (359), 273 states have internal predecessors, (359), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 407 transitions. [2025-01-09 15:37:33,062 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 407 transitions. Word has length 114 [2025-01-09 15:37:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 407 transitions. [2025-01-09 15:37:33,063 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 407 transitions. [2025-01-09 15:37:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:37:33,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:33,064 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:37:33,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash 637510949, now seen corresponding path program 1 times [2025-01-09 15:37:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562071805] [2025-01-09 15:37:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:33,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:37:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:37:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562071805] [2025-01-09 15:37:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562071805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656055339] [2025-01-09 15:37:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:33,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:33,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:33,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:33,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:33,558 INFO L87 Difference]: Start difference. First operand 301 states and 407 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:33,887 INFO L93 Difference]: Finished difference Result 688 states and 925 transitions. [2025-01-09 15:37:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 114 [2025-01-09 15:37:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:33,892 INFO L225 Difference]: With dead ends: 688 [2025-01-09 15:37:33,892 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 15:37:33,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:33,893 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 331 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:33,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 344 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 15:37:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 350. [2025-01-09 15:37:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 321 states have (on average 1.3333333333333333) internal successors, (428), 322 states have internal predecessors, (428), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 476 transitions. [2025-01-09 15:37:33,951 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 476 transitions. Word has length 114 [2025-01-09 15:37:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:33,951 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 476 transitions. [2025-01-09 15:37:33,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 476 transitions. [2025-01-09 15:37:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:37:33,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:33,953 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:37:33,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:33,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 39434129, now seen corresponding path program 1 times [2025-01-09 15:37:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912090349] [2025-01-09 15:37:33,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:33,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:37:33,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:37:33,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:33,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912090349] [2025-01-09 15:37:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912090349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:34,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462012807] [2025-01-09 15:37:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:34,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:34,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:34,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:34,219 INFO L87 Difference]: Start difference. First operand 350 states and 476 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:37:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:34,377 INFO L93 Difference]: Finished difference Result 691 states and 929 transitions. [2025-01-09 15:37:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-01-09 15:37:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:34,379 INFO L225 Difference]: With dead ends: 691 [2025-01-09 15:37:34,379 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 15:37:34,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:34,381 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 339 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:34,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 375 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 15:37:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2025-01-09 15:37:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 291 states have (on average 1.3058419243986255) internal successors, (380), 292 states have internal predecessors, (380), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 428 transitions. [2025-01-09 15:37:34,412 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 428 transitions. Word has length 114 [2025-01-09 15:37:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:34,412 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 428 transitions. [2025-01-09 15:37:34,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:37:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 428 transitions. [2025-01-09 15:37:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:37:34,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:34,414 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:34,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:37:34,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:34,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1402043375, now seen corresponding path program 1 times [2025-01-09 15:37:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612620818] [2025-01-09 15:37:34,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:34,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:37:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:37:34,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:34,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612620818] [2025-01-09 15:37:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612620818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:34,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:34,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880904195] [2025-01-09 15:37:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:34,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:34,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:34,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:34,831 INFO L87 Difference]: Start difference. First operand 320 states and 428 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:35,201 INFO L93 Difference]: Finished difference Result 685 states and 906 transitions. [2025-01-09 15:37:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:37:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-01-09 15:37:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:35,205 INFO L225 Difference]: With dead ends: 685 [2025-01-09 15:37:35,205 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 15:37:35,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:37:35,207 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 163 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:35,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 563 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 15:37:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2025-01-09 15:37:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 293 states have (on average 1.3037542662116042) internal successors, (382), 294 states have internal predecessors, (382), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:37:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 430 transitions. [2025-01-09 15:37:35,245 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 430 transitions. Word has length 115 [2025-01-09 15:37:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:35,245 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 430 transitions. [2025-01-09 15:37:35,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 430 transitions. [2025-01-09 15:37:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:37:35,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:35,247 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:35,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:37:35,247 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:35,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2083830233, now seen corresponding path program 1 times [2025-01-09 15:37:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119604631] [2025-01-09 15:37:35,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:37:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:37:35,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:35,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119604631] [2025-01-09 15:37:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119604631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:37:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7397829] [2025-01-09 15:37:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:37:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:36,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:37:36,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:37:36,080 INFO L87 Difference]: Start difference. First operand 322 states and 430 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:37:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:36,739 INFO L93 Difference]: Finished difference Result 946 states and 1263 transitions. [2025-01-09 15:37:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:37:36,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 115 [2025-01-09 15:37:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:36,742 INFO L225 Difference]: With dead ends: 946 [2025-01-09 15:37:36,742 INFO L226 Difference]: Without dead ends: 627 [2025-01-09 15:37:36,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:37:36,744 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 370 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:36,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 669 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-01-09 15:37:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 411. [2025-01-09 15:37:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.2978142076502732) internal successors, (475), 367 states have internal predecessors, (475), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 551 transitions. [2025-01-09 15:37:36,783 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 551 transitions. Word has length 115 [2025-01-09 15:37:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:36,783 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 551 transitions. [2025-01-09 15:37:36,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 15:37:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 551 transitions. [2025-01-09 15:37:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:37:36,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:36,785 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:37:36,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2040578273, now seen corresponding path program 1 times [2025-01-09 15:37:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705592190] [2025-01-09 15:37:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:37:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:37:36,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:36,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:36,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705592190] [2025-01-09 15:37:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705592190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485838598] [2025-01-09 15:37:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:36,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:36,879 INFO L87 Difference]: Start difference. First operand 411 states and 551 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:36,939 INFO L93 Difference]: Finished difference Result 754 states and 1003 transitions. [2025-01-09 15:37:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-01-09 15:37:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:36,942 INFO L225 Difference]: With dead ends: 754 [2025-01-09 15:37:36,942 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 15:37:36,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:36,943 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:36,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 427 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 15:37:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 411. [2025-01-09 15:37:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.2923497267759563) internal successors, (473), 367 states have internal predecessors, (473), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 549 transitions. [2025-01-09 15:37:36,980 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 549 transitions. Word has length 116 [2025-01-09 15:37:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:36,980 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 549 transitions. [2025-01-09 15:37:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 549 transitions. [2025-01-09 15:37:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:37:36,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:36,981 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:37:36,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1617876447, now seen corresponding path program 1 times [2025-01-09 15:37:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895558688] [2025-01-09 15:37:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:37:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:37:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:37,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:37,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895558688] [2025-01-09 15:37:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895558688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372719314] [2025-01-09 15:37:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:37,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:37,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:37,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:37,178 INFO L87 Difference]: Start difference. First operand 411 states and 549 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:37,378 INFO L93 Difference]: Finished difference Result 767 states and 1019 transitions. [2025-01-09 15:37:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-01-09 15:37:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:37,382 INFO L225 Difference]: With dead ends: 767 [2025-01-09 15:37:37,382 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 15:37:37,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:37,383 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 49 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:37,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 410 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 15:37:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 411. [2025-01-09 15:37:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.278688524590164) internal successors, (468), 367 states have internal predecessors, (468), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 544 transitions. [2025-01-09 15:37:37,425 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 544 transitions. Word has length 116 [2025-01-09 15:37:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:37,426 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 544 transitions. [2025-01-09 15:37:37,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 544 transitions. [2025-01-09 15:37:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:37:37,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:37,429 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:37,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:37:37,429 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:37,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2136694794, now seen corresponding path program 1 times [2025-01-09 15:37:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:37,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782990923] [2025-01-09 15:37:37,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:37:37,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:37:37,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:37,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:38,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:38,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782990923] [2025-01-09 15:37:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782990923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:37:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814656809] [2025-01-09 15:37:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:38,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:37:38,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:38,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:37:38,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:37:38,280 INFO L87 Difference]: Start difference. First operand 411 states and 544 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:39,077 INFO L93 Difference]: Finished difference Result 1065 states and 1401 transitions. [2025-01-09 15:37:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:37:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2025-01-09 15:37:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:39,080 INFO L225 Difference]: With dead ends: 1065 [2025-01-09 15:37:39,080 INFO L226 Difference]: Without dead ends: 746 [2025-01-09 15:37:39,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:37:39,081 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 399 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:39,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 739 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-09 15:37:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 490. [2025-01-09 15:37:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 445 states have (on average 1.301123595505618) internal successors, (579), 446 states have internal predecessors, (579), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 655 transitions. [2025-01-09 15:37:39,118 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 655 transitions. Word has length 117 [2025-01-09 15:37:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 655 transitions. [2025-01-09 15:37:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 655 transitions. [2025-01-09 15:37:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:37:39,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:39,120 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:37:39,120 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash -527691274, now seen corresponding path program 1 times [2025-01-09 15:37:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942591704] [2025-01-09 15:37:39,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:37:39,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:37:39,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:39,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942591704] [2025-01-09 15:37:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942591704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866069620] [2025-01-09 15:37:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:39,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:39,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:39,307 INFO L87 Difference]: Start difference. First operand 490 states and 655 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:37:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:39,443 INFO L93 Difference]: Finished difference Result 860 states and 1134 transitions. [2025-01-09 15:37:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:39,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-01-09 15:37:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:39,445 INFO L225 Difference]: With dead ends: 860 [2025-01-09 15:37:39,446 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 15:37:39,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:39,448 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 207 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:39,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 363 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 15:37:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 500. [2025-01-09 15:37:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 455 states have (on average 1.2967032967032968) internal successors, (590), 456 states have internal predecessors, (590), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 666 transitions. [2025-01-09 15:37:39,485 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 666 transitions. Word has length 117 [2025-01-09 15:37:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:39,485 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 666 transitions. [2025-01-09 15:37:39,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:37:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 666 transitions. [2025-01-09 15:37:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:37:39,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:39,486 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:39,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:37:39,487 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:39,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -269525836, now seen corresponding path program 1 times [2025-01-09 15:37:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253922831] [2025-01-09 15:37:39,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:39,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:37:39,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:37:39,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:39,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253922831] [2025-01-09 15:37:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253922831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:39,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:39,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204666342] [2025-01-09 15:37:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:39,835 INFO L87 Difference]: Start difference. First operand 500 states and 666 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:40,096 INFO L93 Difference]: Finished difference Result 856 states and 1127 transitions. [2025-01-09 15:37:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-01-09 15:37:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:40,099 INFO L225 Difference]: With dead ends: 856 [2025-01-09 15:37:40,099 INFO L226 Difference]: Without dead ends: 528 [2025-01-09 15:37:40,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:40,100 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 187 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:40,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 381 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-09 15:37:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 491. [2025-01-09 15:37:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 446 states have (on average 1.2847533632286996) internal successors, (573), 447 states have internal predecessors, (573), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 649 transitions. [2025-01-09 15:37:40,137 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 649 transitions. Word has length 117 [2025-01-09 15:37:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:40,137 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 649 transitions. [2025-01-09 15:37:40,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 649 transitions. [2025-01-09 15:37:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:37:40,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:40,138 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:40,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:37:40,138 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:40,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1212832883, now seen corresponding path program 1 times [2025-01-09 15:37:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155726246] [2025-01-09 15:37:40,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:37:40,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:37:40,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:40,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155726246] [2025-01-09 15:37:40,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155726246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:40,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:40,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298285661] [2025-01-09 15:37:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:40,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:40,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:40,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:40,303 INFO L87 Difference]: Start difference. First operand 491 states and 649 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:40,561 INFO L93 Difference]: Finished difference Result 1047 states and 1354 transitions. [2025-01-09 15:37:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:40,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-01-09 15:37:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:40,564 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 15:37:40,564 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 15:37:40,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:40,566 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:40,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 480 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 15:37:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 501. [2025-01-09 15:37:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 456 states have (on average 1.2785087719298245) internal successors, (583), 457 states have internal predecessors, (583), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 659 transitions. [2025-01-09 15:37:40,603 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 659 transitions. Word has length 118 [2025-01-09 15:37:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 659 transitions. [2025-01-09 15:37:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 659 transitions. [2025-01-09 15:37:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:37:40,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:40,606 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:40,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:37:40,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash -781311823, now seen corresponding path program 1 times [2025-01-09 15:37:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836679187] [2025-01-09 15:37:40,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:37:40,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:37:40,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:40,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836679187] [2025-01-09 15:37:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836679187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:37:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278638126] [2025-01-09 15:37:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:41,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:37:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:41,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:37:41,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:41,100 INFO L87 Difference]: Start difference. First operand 501 states and 659 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:41,581 INFO L93 Difference]: Finished difference Result 939 states and 1204 transitions. [2025-01-09 15:37:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:37:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2025-01-09 15:37:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:41,583 INFO L225 Difference]: With dead ends: 939 [2025-01-09 15:37:41,583 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 15:37:41,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:37:41,585 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 297 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:41,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 591 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 15:37:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 479. [2025-01-09 15:37:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 434 states have (on average 1.2649769585253456) internal successors, (549), 435 states have internal predecessors, (549), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 625 transitions. [2025-01-09 15:37:41,621 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 625 transitions. Word has length 118 [2025-01-09 15:37:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:41,621 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 625 transitions. [2025-01-09 15:37:41,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 625 transitions. [2025-01-09 15:37:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:37:41,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:41,623 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:41,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:37:41,623 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -184171651, now seen corresponding path program 1 times [2025-01-09 15:37:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228555070] [2025-01-09 15:37:41,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:41,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:37:41,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:37:41,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:41,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228555070] [2025-01-09 15:37:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228555070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:37:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368893126] [2025-01-09 15:37:42,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:42,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:37:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:42,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:37:42,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:42,060 INFO L87 Difference]: Start difference. First operand 479 states and 625 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:42,546 INFO L93 Difference]: Finished difference Result 944 states and 1205 transitions. [2025-01-09 15:37:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2025-01-09 15:37:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:42,549 INFO L225 Difference]: With dead ends: 944 [2025-01-09 15:37:42,549 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 15:37:42,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:37:42,550 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 295 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:42,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 601 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 15:37:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 473. [2025-01-09 15:37:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 428 states have (on average 1.2616822429906542) internal successors, (540), 429 states have internal predecessors, (540), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 616 transitions. [2025-01-09 15:37:42,585 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 616 transitions. Word has length 118 [2025-01-09 15:37:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:42,586 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 616 transitions. [2025-01-09 15:37:42,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:37:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 616 transitions. [2025-01-09 15:37:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:37:42,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:42,587 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:37:42,587 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1464035329, now seen corresponding path program 1 times [2025-01-09 15:37:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:42,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650394172] [2025-01-09 15:37:42,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:37:42,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:37:42,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650394172] [2025-01-09 15:37:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650394172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78320354] [2025-01-09 15:37:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:42,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:42,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:42,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:42,862 INFO L87 Difference]: Start difference. First operand 473 states and 616 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:43,169 INFO L93 Difference]: Finished difference Result 938 states and 1196 transitions. [2025-01-09 15:37:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:43,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-01-09 15:37:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:43,172 INFO L225 Difference]: With dead ends: 938 [2025-01-09 15:37:43,173 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 15:37:43,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:43,174 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 97 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:43,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 472 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 15:37:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 473. [2025-01-09 15:37:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 428 states have (on average 1.2546728971962617) internal successors, (537), 429 states have internal predecessors, (537), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 613 transitions. [2025-01-09 15:37:43,240 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 613 transitions. Word has length 118 [2025-01-09 15:37:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 613 transitions. [2025-01-09 15:37:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 613 transitions. [2025-01-09 15:37:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:37:43,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:43,242 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:43,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:37:43,242 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 345965562, now seen corresponding path program 1 times [2025-01-09 15:37:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699883949] [2025-01-09 15:37:43,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:37:43,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:37:43,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699883949] [2025-01-09 15:37:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699883949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72195661] [2025-01-09 15:37:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:43,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:43,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:43,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:43,573 INFO L87 Difference]: Start difference. First operand 473 states and 613 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:43,868 INFO L93 Difference]: Finished difference Result 1043 states and 1339 transitions. [2025-01-09 15:37:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:37:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:43,871 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 15:37:43,871 INFO L226 Difference]: Without dead ends: 728 [2025-01-09 15:37:43,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:43,872 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:43,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 898 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-01-09 15:37:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 637. [2025-01-09 15:37:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 592 states have (on average 1.2550675675675675) internal successors, (743), 593 states have internal predecessors, (743), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 819 transitions. [2025-01-09 15:37:43,914 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 819 transitions. Word has length 119 [2025-01-09 15:37:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 819 transitions. [2025-01-09 15:37:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 819 transitions. [2025-01-09 15:37:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:37:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:43,915 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:37:43,916 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1047030140, now seen corresponding path program 1 times [2025-01-09 15:37:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59104374] [2025-01-09 15:37:43,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:43,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:37:43,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:37:43,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:43,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59104374] [2025-01-09 15:37:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59104374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792954878] [2025-01-09 15:37:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:44,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:44,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:44,167 INFO L87 Difference]: Start difference. First operand 637 states and 819 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:44,419 INFO L93 Difference]: Finished difference Result 1190 states and 1515 transitions. [2025-01-09 15:37:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:37:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:44,422 INFO L225 Difference]: With dead ends: 1190 [2025-01-09 15:37:44,422 INFO L226 Difference]: Without dead ends: 755 [2025-01-09 15:37:44,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:44,423 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 336 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:44,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 702 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-01-09 15:37:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 701. [2025-01-09 15:37:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 656 states have (on average 1.2317073170731707) internal successors, (808), 657 states have internal predecessors, (808), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 884 transitions. [2025-01-09 15:37:44,463 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 884 transitions. Word has length 119 [2025-01-09 15:37:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:44,463 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 884 transitions. [2025-01-09 15:37:44,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 884 transitions. [2025-01-09 15:37:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:37:44,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:44,464 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:37:44,464 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:44,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1459472772, now seen corresponding path program 1 times [2025-01-09 15:37:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453934849] [2025-01-09 15:37:44,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:44,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:37:44,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:37:44,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:44,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453934849] [2025-01-09 15:37:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453934849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556344534] [2025-01-09 15:37:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:44,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:44,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:44,677 INFO L87 Difference]: Start difference. First operand 701 states and 884 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:44,878 INFO L93 Difference]: Finished difference Result 1187 states and 1499 transitions. [2025-01-09 15:37:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:44,878 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:37:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:44,880 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 15:37:44,880 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 15:37:44,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:44,882 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 170 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 561 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 15:37:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 625. [2025-01-09 15:37:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 580 states have (on average 1.2344827586206897) internal successors, (716), 581 states have internal predecessors, (716), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 792 transitions. [2025-01-09 15:37:44,966 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 792 transitions. Word has length 119 [2025-01-09 15:37:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:44,966 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 792 transitions. [2025-01-09 15:37:44,966 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 792 transitions. [2025-01-09 15:37:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:37:44,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:44,967 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:37:44,967 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:44,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1246468549, now seen corresponding path program 1 times [2025-01-09 15:37:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4233802] [2025-01-09 15:37:44,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:37:45,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:37:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4233802] [2025-01-09 15:37:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4233802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:37:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712120032] [2025-01-09 15:37:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:37:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:46,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:37:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:37:46,592 INFO L87 Difference]: Start difference. First operand 625 states and 792 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:49,095 INFO L93 Difference]: Finished difference Result 1457 states and 1847 transitions. [2025-01-09 15:37:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 15:37:49,096 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:37:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:49,098 INFO L225 Difference]: With dead ends: 1457 [2025-01-09 15:37:49,098 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 15:37:49,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 15:37:49,100 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 431 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:49,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1537 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:37:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 15:37:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 663. [2025-01-09 15:37:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 618 states have (on average 1.2411003236245954) internal successors, (767), 619 states have internal predecessors, (767), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 843 transitions. [2025-01-09 15:37:49,140 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 843 transitions. Word has length 121 [2025-01-09 15:37:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:49,141 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 843 transitions. [2025-01-09 15:37:49,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 843 transitions. [2025-01-09 15:37:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:37:49,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:49,142 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:49,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:37:49,142 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:49,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1809718985, now seen corresponding path program 1 times [2025-01-09 15:37:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:49,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171388238] [2025-01-09 15:37:49,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:49,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:37:49,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:37:49,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:49,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171388238] [2025-01-09 15:37:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171388238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403555409] [2025-01-09 15:37:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:49,783 INFO L87 Difference]: Start difference. First operand 663 states and 843 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:50,357 INFO L93 Difference]: Finished difference Result 1443 states and 1842 transitions. [2025-01-09 15:37:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:37:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:37:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:50,360 INFO L225 Difference]: With dead ends: 1443 [2025-01-09 15:37:50,360 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 15:37:50,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:37:50,361 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 155 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:50,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1003 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 15:37:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 755. [2025-01-09 15:37:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 710 states have (on average 1.2521126760563381) internal successors, (889), 711 states have internal predecessors, (889), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 965 transitions. [2025-01-09 15:37:50,406 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 965 transitions. Word has length 121 [2025-01-09 15:37:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:50,406 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 965 transitions. [2025-01-09 15:37:50,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 965 transitions. [2025-01-09 15:37:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:50,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:50,407 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:50,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:37:50,407 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:50,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash 439200188, now seen corresponding path program 1 times [2025-01-09 15:37:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:50,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731976193] [2025-01-09 15:37:50,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:50,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:50,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:50,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:50,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731976193] [2025-01-09 15:37:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731976193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:37:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521385639] [2025-01-09 15:37:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:37:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:51,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:37:51,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:37:51,656 INFO L87 Difference]: Start difference. First operand 755 states and 965 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:52,622 INFO L93 Difference]: Finished difference Result 1266 states and 1627 transitions. [2025-01-09 15:37:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:37:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:52,626 INFO L225 Difference]: With dead ends: 1266 [2025-01-09 15:37:52,626 INFO L226 Difference]: Without dead ends: 1264 [2025-01-09 15:37:52,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:37:52,627 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 440 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:52,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 852 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:37:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-01-09 15:37:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 661. [2025-01-09 15:37:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 616 states have (on average 1.2532467532467533) internal successors, (772), 617 states have internal predecessors, (772), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2025-01-09 15:37:52,716 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 123 [2025-01-09 15:37:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:52,716 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2025-01-09 15:37:52,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2025-01-09 15:37:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:52,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:52,719 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:52,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:37:52,719 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 747530495, now seen corresponding path program 1 times [2025-01-09 15:37:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935742704] [2025-01-09 15:37:52,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:52,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:52,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:52,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935742704] [2025-01-09 15:37:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935742704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135554043] [2025-01-09 15:37:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:53,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:53,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:53,545 INFO L87 Difference]: Start difference. First operand 661 states and 848 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:53,927 INFO L93 Difference]: Finished difference Result 1441 states and 1859 transitions. [2025-01-09 15:37:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:53,927 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:53,934 INFO L225 Difference]: With dead ends: 1441 [2025-01-09 15:37:53,934 INFO L226 Difference]: Without dead ends: 972 [2025-01-09 15:37:53,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:53,935 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 197 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:53,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 538 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-01-09 15:37:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 768. [2025-01-09 15:37:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 723 states have (on average 1.2669432918395573) internal successors, (916), 724 states have internal predecessors, (916), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 992 transitions. [2025-01-09 15:37:54,060 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 992 transitions. Word has length 123 [2025-01-09 15:37:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 992 transitions. [2025-01-09 15:37:54,061 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 992 transitions. [2025-01-09 15:37:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:54,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:54,061 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:54,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:37:54,062 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -840817407, now seen corresponding path program 1 times [2025-01-09 15:37:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7807565] [2025-01-09 15:37:54,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:54,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:54,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:54,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:54,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7807565] [2025-01-09 15:37:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7807565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92941368] [2025-01-09 15:37:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:54,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:54,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:54,220 INFO L87 Difference]: Start difference. First operand 768 states and 992 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:54,401 INFO L93 Difference]: Finished difference Result 1512 states and 1955 transitions. [2025-01-09 15:37:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:54,405 INFO L225 Difference]: With dead ends: 1512 [2025-01-09 15:37:54,405 INFO L226 Difference]: Without dead ends: 980 [2025-01-09 15:37:54,406 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-01-09 15:37:54,406 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 42 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:54,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 411 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-01-09 15:37:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 792. [2025-01-09 15:37:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 747 states have (on average 1.2797858099062918) internal successors, (956), 748 states have internal predecessors, (956), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1032 transitions. [2025-01-09 15:37:54,477 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1032 transitions. Word has length 123 [2025-01-09 15:37:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:54,477 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1032 transitions. [2025-01-09 15:37:54,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1032 transitions. [2025-01-09 15:37:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:54,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:54,479 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:54,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:37:54,479 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:54,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2120681085, now seen corresponding path program 1 times [2025-01-09 15:37:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:54,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910275803] [2025-01-09 15:37:54,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:54,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:54,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:54,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:54,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910275803] [2025-01-09 15:37:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910275803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:55,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:55,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:37:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260476733] [2025-01-09 15:37:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:55,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:37:55,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:55,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:37:55,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:55,084 INFO L87 Difference]: Start difference. First operand 792 states and 1032 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:55,550 INFO L93 Difference]: Finished difference Result 1506 states and 1954 transitions. [2025-01-09 15:37:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:55,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-01-09 15:37:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:55,554 INFO L225 Difference]: With dead ends: 1506 [2025-01-09 15:37:55,554 INFO L226 Difference]: Without dead ends: 956 [2025-01-09 15:37:55,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:37:55,555 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 212 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:55,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 512 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-01-09 15:37:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 792. [2025-01-09 15:37:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 747 states have (on average 1.2797858099062918) internal successors, (956), 748 states have internal predecessors, (956), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1032 transitions. [2025-01-09 15:37:55,616 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1032 transitions. Word has length 123 [2025-01-09 15:37:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:55,616 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1032 transitions. [2025-01-09 15:37:55,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1032 transitions. [2025-01-09 15:37:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:55,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:55,617 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:37:55,618 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -786730561, now seen corresponding path program 1 times [2025-01-09 15:37:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569376659] [2025-01-09 15:37:55,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:55,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:55,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569376659] [2025-01-09 15:37:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569376659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339912725] [2025-01-09 15:37:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:56,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:56,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:56,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:56,279 INFO L87 Difference]: Start difference. First operand 792 states and 1032 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:56,714 INFO L93 Difference]: Finished difference Result 1632 states and 2138 transitions. [2025-01-09 15:37:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:56,714 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:56,717 INFO L225 Difference]: With dead ends: 1632 [2025-01-09 15:37:56,717 INFO L226 Difference]: Without dead ends: 1088 [2025-01-09 15:37:56,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:56,718 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 199 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:56,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 549 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-01-09 15:37:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 901. [2025-01-09 15:37:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 856 states have (on average 1.2873831775700935) internal successors, (1102), 857 states have internal predecessors, (1102), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1178 transitions. [2025-01-09 15:37:56,766 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1178 transitions. Word has length 123 [2025-01-09 15:37:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:56,767 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1178 transitions. [2025-01-09 15:37:56,767 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1178 transitions. [2025-01-09 15:37:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:56,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:56,769 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:56,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:37:56,769 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2066594239, now seen corresponding path program 1 times [2025-01-09 15:37:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78991985] [2025-01-09 15:37:56,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:56,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78991985] [2025-01-09 15:37:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78991985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303055479] [2025-01-09 15:37:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:57,324 INFO L87 Difference]: Start difference. First operand 901 states and 1178 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:57,696 INFO L93 Difference]: Finished difference Result 1699 states and 2225 transitions. [2025-01-09 15:37:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:57,696 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:57,699 INFO L225 Difference]: With dead ends: 1699 [2025-01-09 15:37:57,699 INFO L226 Difference]: Without dead ends: 1088 [2025-01-09 15:37:57,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:57,700 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 145 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:57,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 651 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-01-09 15:37:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 909. [2025-01-09 15:37:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 864 states have (on average 1.2847222222222223) internal successors, (1110), 865 states have internal predecessors, (1110), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1186 transitions. [2025-01-09 15:37:57,746 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1186 transitions. Word has length 123 [2025-01-09 15:37:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1186 transitions. [2025-01-09 15:37:57,747 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1186 transitions. [2025-01-09 15:37:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:57,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:57,748 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:37:57,748 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1449130369, now seen corresponding path program 1 times [2025-01-09 15:37:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162328077] [2025-01-09 15:37:57,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:57,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:57,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:57,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162328077] [2025-01-09 15:37:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162328077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:58,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:58,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665002552] [2025-01-09 15:37:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:58,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:58,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:58,333 INFO L87 Difference]: Start difference. First operand 909 states and 1186 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:58,717 INFO L93 Difference]: Finished difference Result 1721 states and 2234 transitions. [2025-01-09 15:37:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:58,720 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:37:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:58,723 INFO L225 Difference]: With dead ends: 1721 [2025-01-09 15:37:58,723 INFO L226 Difference]: Without dead ends: 1099 [2025-01-09 15:37:58,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:58,724 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:58,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 546 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-01-09 15:37:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 901. [2025-01-09 15:37:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 856 states have (on average 1.27803738317757) internal successors, (1094), 857 states have internal predecessors, (1094), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1170 transitions. [2025-01-09 15:37:58,801 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1170 transitions. Word has length 123 [2025-01-09 15:37:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:58,801 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1170 transitions. [2025-01-09 15:37:58,801 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:37:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1170 transitions. [2025-01-09 15:37:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:58,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:58,802 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:58,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:37:58,803 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1419081211, now seen corresponding path program 1 times [2025-01-09 15:37:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961973302] [2025-01-09 15:37:58,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:58,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:58,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961973302] [2025-01-09 15:37:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961973302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:37:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670512129] [2025-01-09 15:37:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:59,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:37:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:59,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:37:59,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:59,323 INFO L87 Difference]: Start difference. First operand 901 states and 1170 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:59,740 INFO L93 Difference]: Finished difference Result 1682 states and 2174 transitions. [2025-01-09 15:37:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-01-09 15:37:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:59,745 INFO L225 Difference]: With dead ends: 1682 [2025-01-09 15:37:59,745 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 15:37:59,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:37:59,747 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 273 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:59,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 518 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 15:37:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 796. [2025-01-09 15:37:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 751 states have (on average 1.25965379494008) internal successors, (946), 752 states have internal predecessors, (946), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1022 transitions. [2025-01-09 15:37:59,800 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1022 transitions. Word has length 123 [2025-01-09 15:37:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:59,800 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1022 transitions. [2025-01-09 15:37:59,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:37:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1022 transitions. [2025-01-09 15:37:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:37:59,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:59,801 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:59,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:37:59,801 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:59,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash -85130687, now seen corresponding path program 1 times [2025-01-09 15:37:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674494632] [2025-01-09 15:37:59,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:59,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:59,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:37:59,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:37:59,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:59,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:37:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674494632] [2025-01-09 15:37:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674494632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922516721] [2025-01-09 15:37:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:59,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:59,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:59,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:59,933 INFO L87 Difference]: Start difference. First operand 796 states and 1022 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:00,069 INFO L93 Difference]: Finished difference Result 1397 states and 1809 transitions. [2025-01-09 15:38:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:38:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:00,072 INFO L225 Difference]: With dead ends: 1397 [2025-01-09 15:38:00,072 INFO L226 Difference]: Without dead ends: 798 [2025-01-09 15:38:00,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:00,073 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 16 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:00,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 337 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-01-09 15:38:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2025-01-09 15:38:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 751 states have (on average 1.2569906790945407) internal successors, (944), 752 states have internal predecessors, (944), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1020 transitions. [2025-01-09 15:38:00,118 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1020 transitions. Word has length 123 [2025-01-09 15:38:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:00,118 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1020 transitions. [2025-01-09 15:38:00,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1020 transitions. [2025-01-09 15:38:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:38:00,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:00,119 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:00,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:38:00,119 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:00,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:00,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1301072707, now seen corresponding path program 1 times [2025-01-09 15:38:00,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209090256] [2025-01-09 15:38:00,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:00,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:00,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:38:00,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:38:00,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:00,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209090256] [2025-01-09 15:38:00,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209090256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:00,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:00,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:38:00,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007884855] [2025-01-09 15:38:00,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:00,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:38:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:00,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:38:00,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:38:00,885 INFO L87 Difference]: Start difference. First operand 796 states and 1020 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:01,337 INFO L93 Difference]: Finished difference Result 1668 states and 2129 transitions. [2025-01-09 15:38:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:38:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:38:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:01,344 INFO L225 Difference]: With dead ends: 1668 [2025-01-09 15:38:01,345 INFO L226 Difference]: Without dead ends: 1098 [2025-01-09 15:38:01,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:38:01,346 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 327 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:01,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 434 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:38:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-01-09 15:38:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 891. [2025-01-09 15:38:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 846 states have (on average 1.24822695035461) internal successors, (1056), 847 states have internal predecessors, (1056), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1132 transitions. [2025-01-09 15:38:01,395 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1132 transitions. Word has length 123 [2025-01-09 15:38:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:01,395 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1132 transitions. [2025-01-09 15:38:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1132 transitions. [2025-01-09 15:38:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:38:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:01,396 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:38:01,396 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 21209029, now seen corresponding path program 1 times [2025-01-09 15:38:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180503729] [2025-01-09 15:38:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:01,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:38:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:38:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180503729] [2025-01-09 15:38:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180503729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:38:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465194336] [2025-01-09 15:38:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:38:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:01,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:38:01,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:38:01,965 INFO L87 Difference]: Start difference. First operand 891 states and 1132 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:02,646 INFO L93 Difference]: Finished difference Result 1667 states and 2111 transitions. [2025-01-09 15:38:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:38:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-01-09 15:38:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:02,651 INFO L225 Difference]: With dead ends: 1667 [2025-01-09 15:38:02,652 INFO L226 Difference]: Without dead ends: 1050 [2025-01-09 15:38:02,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:38:02,658 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 292 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:02,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 954 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:38:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-01-09 15:38:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 888. [2025-01-09 15:38:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 843 states have (on average 1.246737841043891) internal successors, (1051), 844 states have internal predecessors, (1051), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1127 transitions. [2025-01-09 15:38:02,708 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1127 transitions. Word has length 123 [2025-01-09 15:38:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:02,708 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1127 transitions. [2025-01-09 15:38:02,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1127 transitions. [2025-01-09 15:38:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:38:02,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:02,712 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:38:02,712 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:02,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1053305465, now seen corresponding path program 1 times [2025-01-09 15:38:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515591932] [2025-01-09 15:38:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:02,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:38:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:38:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:03,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:03,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515591932] [2025-01-09 15:38:03,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515591932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:03,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:03,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:38:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400692626] [2025-01-09 15:38:03,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:03,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:38:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:03,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:38:03,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:38:03,342 INFO L87 Difference]: Start difference. First operand 888 states and 1127 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:04,239 INFO L93 Difference]: Finished difference Result 2021 states and 2542 transitions. [2025-01-09 15:38:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 15:38:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:38:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:04,243 INFO L225 Difference]: With dead ends: 2021 [2025-01-09 15:38:04,243 INFO L226 Difference]: Without dead ends: 1435 [2025-01-09 15:38:04,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:38:04,247 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 242 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1533 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:38:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-01-09 15:38:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 991. [2025-01-09 15:38:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 946 states have (on average 1.2600422832980973) internal successors, (1192), 947 states have internal predecessors, (1192), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1268 transitions. [2025-01-09 15:38:04,298 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1268 transitions. Word has length 125 [2025-01-09 15:38:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1268 transitions. [2025-01-09 15:38:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1268 transitions. [2025-01-09 15:38:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:38:04,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:04,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:38:04,299 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -226558213, now seen corresponding path program 1 times [2025-01-09 15:38:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662488912] [2025-01-09 15:38:04,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:04,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:38:04,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:38:04,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662488912] [2025-01-09 15:38:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662488912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115975983] [2025-01-09 15:38:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:04,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:04,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:04,434 INFO L87 Difference]: Start difference. First operand 991 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:04,586 INFO L93 Difference]: Finished difference Result 1867 states and 2388 transitions. [2025-01-09 15:38:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-01-09 15:38:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:04,592 INFO L225 Difference]: With dead ends: 1867 [2025-01-09 15:38:04,592 INFO L226 Difference]: Without dead ends: 1181 [2025-01-09 15:38:04,593 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-01-09 15:38:04,595 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 40 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:04,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 454 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-01-09 15:38:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 991. [2025-01-09 15:38:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 946 states have (on average 1.244186046511628) internal successors, (1177), 947 states have internal predecessors, (1177), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1253 transitions. [2025-01-09 15:38:04,648 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1253 transitions. Word has length 125 [2025-01-09 15:38:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:04,649 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1253 transitions. [2025-01-09 15:38:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1253 transitions. [2025-01-09 15:38:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:38:04,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:04,650 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:04,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:38:04,650 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1814906115, now seen corresponding path program 1 times [2025-01-09 15:38:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346365897] [2025-01-09 15:38:04,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:04,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:38:04,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:38:04,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346365897] [2025-01-09 15:38:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346365897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:05,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:05,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:38:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272578689] [2025-01-09 15:38:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:05,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:38:05,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:05,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:38:05,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:38:05,365 INFO L87 Difference]: Start difference. First operand 991 states and 1253 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:05,999 INFO L93 Difference]: Finished difference Result 1813 states and 2292 transitions. [2025-01-09 15:38:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:38:05,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-01-09 15:38:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:06,004 INFO L225 Difference]: With dead ends: 1813 [2025-01-09 15:38:06,004 INFO L226 Difference]: Without dead ends: 1106 [2025-01-09 15:38:06,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:38:06,005 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 398 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:06,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 598 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:38:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-01-09 15:38:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 981. [2025-01-09 15:38:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 936 states have (on average 1.2371794871794872) internal successors, (1158), 937 states have internal predecessors, (1158), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1234 transitions. [2025-01-09 15:38:06,086 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1234 transitions. Word has length 125 [2025-01-09 15:38:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1234 transitions. [2025-01-09 15:38:06,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1234 transitions. [2025-01-09 15:38:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:38:06,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:06,088 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:38:06,088 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:06,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -702229171, now seen corresponding path program 1 times [2025-01-09 15:38:06,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:06,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003352945] [2025-01-09 15:38:06,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:06,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:38:06,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:38:06,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:06,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003352945] [2025-01-09 15:38:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003352945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:38:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137452159] [2025-01-09 15:38:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:38:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:07,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:38:07,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:38:07,116 INFO L87 Difference]: Start difference. First operand 981 states and 1234 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:08,276 INFO L93 Difference]: Finished difference Result 1793 states and 2263 transitions. [2025-01-09 15:38:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:38:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-01-09 15:38:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:08,278 INFO L225 Difference]: With dead ends: 1793 [2025-01-09 15:38:08,278 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 15:38:08,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:38:08,281 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 269 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:08,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1051 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:38:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 15:38:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 981. [2025-01-09 15:38:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 936 states have (on average 1.235042735042735) internal successors, (1156), 937 states have internal predecessors, (1156), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1232 transitions. [2025-01-09 15:38:08,329 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1232 transitions. Word has length 125 [2025-01-09 15:38:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:08,329 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1232 transitions. [2025-01-09 15:38:08,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1232 transitions. [2025-01-09 15:38:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:38:08,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:08,330 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:08,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:38:08,331 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1207851261, now seen corresponding path program 1 times [2025-01-09 15:38:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021011264] [2025-01-09 15:38:08,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:08,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:38:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:38:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021011264] [2025-01-09 15:38:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021011264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:08,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446080499] [2025-01-09 15:38:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:08,480 INFO L87 Difference]: Start difference. First operand 981 states and 1232 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:08,605 INFO L93 Difference]: Finished difference Result 1593 states and 2024 transitions. [2025-01-09 15:38:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:08,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-01-09 15:38:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:08,607 INFO L225 Difference]: With dead ends: 1593 [2025-01-09 15:38:08,607 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 15:38:08,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:08,608 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 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-01-09 15:38:08,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 15:38:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 15:38:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 836 states have (on average 1.2248803827751196) internal successors, (1024), 837 states have internal predecessors, (1024), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1100 transitions. [2025-01-09 15:38:08,655 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1100 transitions. Word has length 127 [2025-01-09 15:38:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:08,655 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1100 transitions. [2025-01-09 15:38:08,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1100 transitions. [2025-01-09 15:38:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:38:08,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:08,656 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:38:08,657 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -625101047, now seen corresponding path program 1 times [2025-01-09 15:38:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560604290] [2025-01-09 15:38:08,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:08,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:38:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:38:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:38:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560604290] [2025-01-09 15:38:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560604290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 15:38:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263323085] [2025-01-09 15:38:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:09,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 15:38:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:09,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 15:38:09,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:38:09,732 INFO L87 Difference]: Start difference. First operand 881 states and 1100 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:11,059 INFO L93 Difference]: Finished difference Result 1588 states and 1985 transitions. [2025-01-09 15:38:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 15:38:11,060 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 127 [2025-01-09 15:38:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:11,061 INFO L225 Difference]: With dead ends: 1588 [2025-01-09 15:38:11,061 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 15:38:11,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:38:11,063 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 292 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:11,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1327 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:38:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 15:38:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 869. [2025-01-09 15:38:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 824 states have (on average 1.2257281553398058) internal successors, (1010), 825 states have internal predecessors, (1010), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1086 transitions. [2025-01-09 15:38:11,112 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1086 transitions. Word has length 127 [2025-01-09 15:38:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:11,112 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1086 transitions. [2025-01-09 15:38:11,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:38:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1086 transitions. [2025-01-09 15:38:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 15:38:11,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:11,114 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:11,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 15:38:11,114 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:11,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -697757886, now seen corresponding path program 1 times [2025-01-09 15:38:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836511947] [2025-01-09 15:38:11,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 15:38:11,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 15:38:11,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:11,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-01-09 15:38:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836511947] [2025-01-09 15:38:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836511947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449026373] [2025-01-09 15:38:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:11,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:38:11,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:38:11,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 15:38:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 15:38:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:12,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 15:38:12,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:14,145 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-01-09 15:38:14,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:14,682 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 15 treesize of output 15 [2025-01-09 15:38:14,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:14,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:14,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:14,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2025-01-09 15:38:14,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:14,866 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 49 treesize of output 25 [2025-01-09 15:38:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 3 proven. 561 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-01-09 15:38:14,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449026373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:15,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:38:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2025-01-09 15:38:15,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953939626] [2025-01-09 15:38:15,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:38:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:38:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:38:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:38:15,057 INFO L87 Difference]: Start difference. First operand 869 states and 1086 transitions. Second operand has 17 states, 16 states have (on average 9.9375) internal successors, (159), 17 states have internal predecessors, (159), 6 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2025-01-09 15:38:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:15,887 INFO L93 Difference]: Finished difference Result 1511 states and 1902 transitions. [2025-01-09 15:38:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:38:15,888 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 9.9375) internal successors, (159), 17 states have internal predecessors, (159), 6 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) Word has length 226 [2025-01-09 15:38:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:15,890 INFO L225 Difference]: With dead ends: 1511 [2025-01-09 15:38:15,890 INFO L226 Difference]: Without dead ends: 917 [2025-01-09 15:38:15,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:38:15,891 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 277 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:15,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 747 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:38:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-01-09 15:38:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 817. [2025-01-09 15:38:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 770 states have (on average 1.2012987012987013) internal successors, (925), 771 states have internal predecessors, (925), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1001 transitions. [2025-01-09 15:38:15,944 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1001 transitions. Word has length 226 [2025-01-09 15:38:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:15,944 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1001 transitions. [2025-01-09 15:38:15,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 9.9375) internal successors, (159), 17 states have internal predecessors, (159), 6 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2025-01-09 15:38:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1001 transitions. [2025-01-09 15:38:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 15:38:15,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:15,946 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:15,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:38:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:16,147 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:16,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1878538616, now seen corresponding path program 1 times [2025-01-09 15:38:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232062171] [2025-01-09 15:38:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:16,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 15:38:16,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 15:38:16,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:16,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2025-01-09 15:38:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232062171] [2025-01-09 15:38:16,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232062171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:16,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:16,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529623959] [2025-01-09 15:38:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:16,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:16,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:16,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:16,354 INFO L87 Difference]: Start difference. First operand 817 states and 1001 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:16,476 INFO L93 Difference]: Finished difference Result 1519 states and 1885 transitions. [2025-01-09 15:38:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:16,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 229 [2025-01-09 15:38:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:16,478 INFO L225 Difference]: With dead ends: 1519 [2025-01-09 15:38:16,478 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 15:38:16,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:16,479 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 58 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:16,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 318 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 15:38:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 835. [2025-01-09 15:38:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 788 states have (on average 1.1967005076142132) internal successors, (943), 789 states have internal predecessors, (943), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:38:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1019 transitions. [2025-01-09 15:38:16,533 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1019 transitions. Word has length 229 [2025-01-09 15:38:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1019 transitions. [2025-01-09 15:38:16,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1019 transitions. [2025-01-09 15:38:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 15:38:16,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:16,535 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-01-09 15:38:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 15:38:16,535 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -115606090, now seen corresponding path program 1 times [2025-01-09 15:38:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801086443] [2025-01-09 15:38:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:16,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 15:38:16,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 15:38:16,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 15:38:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801086443] [2025-01-09 15:38:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801086443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792549034] [2025-01-09 15:38:17,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:17,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:17,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:17,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:38:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:38:17,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 15:38:17,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 15:38:17,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:17,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:17,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 15:38:17,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:19,771 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-01-09 15:38:20,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:20,054 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 15 treesize of output 15 [2025-01-09 15:38:20,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:20,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:20,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 15:38:20,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:20,255 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 42 treesize of output 22 [2025-01-09 15:38:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 10 proven. 552 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-01-09 15:38:20,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792549034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:20,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:38:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2025-01-09 15:38:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338951697] [2025-01-09 15:38:20,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:38:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:38:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:38:20,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:38:20,474 INFO L87 Difference]: Start difference. First operand 835 states and 1019 transitions. Second operand has 19 states, 18 states have (on average 9.055555555555555) internal successors, (163), 19 states have internal predecessors, (163), 7 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) [2025-01-09 15:38:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:21,706 INFO L93 Difference]: Finished difference Result 2182 states and 2658 transitions. [2025-01-09 15:38:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:38:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 9.055555555555555) internal successors, (163), 19 states have internal predecessors, (163), 7 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) Word has length 229 [2025-01-09 15:38:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:21,709 INFO L225 Difference]: With dead ends: 2182 [2025-01-09 15:38:21,709 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 15:38:21,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 15:38:21,711 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 668 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1081 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:38:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 15:38:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1025. [2025-01-09 15:38:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 948 states have (on average 1.1729957805907174) internal successors, (1112), 950 states have internal predecessors, (1112), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1236 transitions. [2025-01-09 15:38:21,801 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1236 transitions. Word has length 229 [2025-01-09 15:38:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1236 transitions. [2025-01-09 15:38:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 9.055555555555555) internal successors, (163), 19 states have internal predecessors, (163), 7 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) [2025-01-09 15:38:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1236 transitions. [2025-01-09 15:38:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 15:38:21,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:21,803 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:21,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:38:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-01-09 15:38:22,004 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 481534082, now seen corresponding path program 1 times [2025-01-09 15:38:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77192229] [2025-01-09 15:38:22,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:22,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 15:38:22,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 15:38:22,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 15:38:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77192229] [2025-01-09 15:38:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77192229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234559723] [2025-01-09 15:38:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:23,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:23,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:23,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:38:23,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:38:23,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 15:38:23,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 15:38:23,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:23,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:38:23,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:23,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 15:38:23,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 15:38:23,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 15:38:23,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 15:38:23,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:23,952 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-01-09 15:38:23,952 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 2 case distinctions, treesize of input 23 treesize of output 25 [2025-01-09 15:38:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 829 proven. 192 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 15:38:24,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234559723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:24,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:38:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 17 [2025-01-09 15:38:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453513181] [2025-01-09 15:38:24,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:38:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:38:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:24,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:38:24,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:38:24,270 INFO L87 Difference]: Start difference. First operand 1025 states and 1236 transitions. Second operand has 17 states, 16 states have (on average 10.75) internal successors, (172), 17 states have internal predecessors, (172), 8 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) [2025-01-09 15:38:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:25,190 INFO L93 Difference]: Finished difference Result 2232 states and 2719 transitions. [2025-01-09 15:38:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:38:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 10.75) internal successors, (172), 17 states have internal predecessors, (172), 8 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) Word has length 229 [2025-01-09 15:38:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:25,193 INFO L225 Difference]: With dead ends: 2232 [2025-01-09 15:38:25,193 INFO L226 Difference]: Without dead ends: 1456 [2025-01-09 15:38:25,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:38:25,194 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 489 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:25,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1118 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:38:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-01-09 15:38:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1180. [2025-01-09 15:38:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1103 states have (on average 1.173164097914778) internal successors, (1294), 1105 states have internal predecessors, (1294), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1418 transitions. [2025-01-09 15:38:25,286 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1418 transitions. Word has length 229 [2025-01-09 15:38:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:25,286 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1418 transitions. [2025-01-09 15:38:25,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 10.75) internal successors, (172), 17 states have internal predecessors, (172), 8 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) [2025-01-09 15:38:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1418 transitions. [2025-01-09 15:38:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 15:38:25,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:25,288 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:25,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:38:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:25,493 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash 306079101, now seen corresponding path program 1 times [2025-01-09 15:38:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518459346] [2025-01-09 15:38:25,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 15:38:25,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 15:38:25,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:25,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-01-09 15:38:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518459346] [2025-01-09 15:38:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518459346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329872110] [2025-01-09 15:38:26,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:26,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:26,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:26,264 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:38:26,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 15:38:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 15:38:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 15:38:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:26,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:38:26,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:26,945 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 15:38:26,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 15:38:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:27,072 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 15:38:27,072 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 2 case distinctions, treesize of input 38 treesize of output 33 [2025-01-09 15:38:27,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 15:38:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-01-09 15:38:27,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:27,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-01-09 15:38:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-01-09 15:38:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329872110] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:38:27,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:38:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2025-01-09 15:38:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373019664] [2025-01-09 15:38:27,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:38:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 15:38:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:27,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 15:38:27,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:38:27,591 INFO L87 Difference]: Start difference. First operand 1180 states and 1418 transitions. Second operand has 24 states, 23 states have (on average 9.434782608695652) internal successors, (217), 24 states have internal predecessors, (217), 6 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 5 states have call predecessors, (48), 6 states have call successors, (48) [2025-01-09 15:38:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:28,445 INFO L93 Difference]: Finished difference Result 1831 states and 2215 transitions. [2025-01-09 15:38:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:38:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 9.434782608695652) internal successors, (217), 24 states have internal predecessors, (217), 6 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 5 states have call predecessors, (48), 6 states have call successors, (48) Word has length 232 [2025-01-09 15:38:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:28,448 INFO L225 Difference]: With dead ends: 1831 [2025-01-09 15:38:28,448 INFO L226 Difference]: Without dead ends: 1275 [2025-01-09 15:38:28,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 453 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:38:28,450 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 289 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:28,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 956 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:38:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-01-09 15:38:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 990. [2025-01-09 15:38:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 913 states have (on average 1.131434830230011) internal successors, (1033), 915 states have internal predecessors, (1033), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1157 transitions. [2025-01-09 15:38:28,540 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1157 transitions. Word has length 232 [2025-01-09 15:38:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:28,541 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1157 transitions. [2025-01-09 15:38:28,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 9.434782608695652) internal successors, (217), 24 states have internal predecessors, (217), 6 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 5 states have call predecessors, (48), 6 states have call successors, (48) [2025-01-09 15:38:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1157 transitions. [2025-01-09 15:38:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 15:38:28,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:28,543 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:28,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 15:38:28,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-01-09 15:38:28,743 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash -935065732, now seen corresponding path program 1 times [2025-01-09 15:38:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072154220] [2025-01-09 15:38:28,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 15:38:28,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 15:38:28,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-01-09 15:38:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072154220] [2025-01-09 15:38:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072154220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:38:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689672470] [2025-01-09 15:38:29,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:29,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:38:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:29,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:38:29,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:29,085 INFO L87 Difference]: Start difference. First operand 990 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:29,288 INFO L93 Difference]: Finished difference Result 2008 states and 2320 transitions. [2025-01-09 15:38:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:38:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-01-09 15:38:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:29,291 INFO L225 Difference]: With dead ends: 2008 [2025-01-09 15:38:29,291 INFO L226 Difference]: Without dead ends: 1270 [2025-01-09 15:38:29,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:38:29,293 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 191 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:29,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 443 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-01-09 15:38:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1037. [2025-01-09 15:38:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 960 states have (on average 1.1322916666666667) internal successors, (1087), 962 states have internal predecessors, (1087), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1211 transitions. [2025-01-09 15:38:29,384 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1211 transitions. Word has length 233 [2025-01-09 15:38:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:29,384 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1211 transitions. [2025-01-09 15:38:29,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1211 transitions. [2025-01-09 15:38:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 15:38:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:29,386 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 15:38:29,386 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 853398652, now seen corresponding path program 1 times [2025-01-09 15:38:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121344205] [2025-01-09 15:38:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:29,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 15:38:29,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 15:38:29,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:29,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-01-09 15:38:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121344205] [2025-01-09 15:38:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121344205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:29,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:29,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:38:29,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272829984] [2025-01-09 15:38:29,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:29,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:38:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:29,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:38:29,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:29,748 INFO L87 Difference]: Start difference. First operand 1037 states and 1211 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:29,976 INFO L93 Difference]: Finished difference Result 1939 states and 2252 transitions. [2025-01-09 15:38:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:38:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-01-09 15:38:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:29,979 INFO L225 Difference]: With dead ends: 1939 [2025-01-09 15:38:29,979 INFO L226 Difference]: Without dead ends: 1085 [2025-01-09 15:38:29,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:38:29,980 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 175 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:29,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 463 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-01-09 15:38:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1037. [2025-01-09 15:38:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 960 states have (on average 1.128125) internal successors, (1083), 962 states have internal predecessors, (1083), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1207 transitions. [2025-01-09 15:38:30,073 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1207 transitions. Word has length 233 [2025-01-09 15:38:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:30,073 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1207 transitions. [2025-01-09 15:38:30,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1207 transitions. [2025-01-09 15:38:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 15:38:30,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:30,075 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:30,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 15:38:30,075 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1554463230, now seen corresponding path program 1 times [2025-01-09 15:38:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:30,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080280467] [2025-01-09 15:38:30,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:30,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:30,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 15:38:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 15:38:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:30,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-01-09 15:38:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080280467] [2025-01-09 15:38:30,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080280467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:38:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237711078] [2025-01-09 15:38:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:30,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:38:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:30,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:38:30,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:30,483 INFO L87 Difference]: Start difference. First operand 1037 states and 1207 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:30,739 INFO L93 Difference]: Finished difference Result 2067 states and 2400 transitions. [2025-01-09 15:38:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:38:30,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 233 [2025-01-09 15:38:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:30,742 INFO L225 Difference]: With dead ends: 2067 [2025-01-09 15:38:30,742 INFO L226 Difference]: Without dead ends: 1213 [2025-01-09 15:38:30,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:38:30,743 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 70 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 972 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-01-09 15:38:30,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 972 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-01-09 15:38:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 954. [2025-01-09 15:38:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 877 states have (on average 1.129988597491448) internal successors, (991), 879 states have internal predecessors, (991), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1115 transitions. [2025-01-09 15:38:30,843 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1115 transitions. Word has length 233 [2025-01-09 15:38:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:30,844 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1115 transitions. [2025-01-09 15:38:30,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1115 transitions. [2025-01-09 15:38:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 15:38:30,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:30,845 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:30,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 15:38:30,846 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -279989447, now seen corresponding path program 1 times [2025-01-09 15:38:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934724589] [2025-01-09 15:38:30,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:30,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 15:38:30,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 15:38:30,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:30,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-01-09 15:38:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934724589] [2025-01-09 15:38:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934724589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:31,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:38:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698542217] [2025-01-09 15:38:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:38:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:31,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:38:31,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:31,157 INFO L87 Difference]: Start difference. First operand 954 states and 1115 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:31,313 INFO L93 Difference]: Finished difference Result 1698 states and 1959 transitions. [2025-01-09 15:38:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:38:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-01-09 15:38:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:31,315 INFO L225 Difference]: With dead ends: 1698 [2025-01-09 15:38:31,315 INFO L226 Difference]: Without dead ends: 1100 [2025-01-09 15:38:31,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:31,316 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 61 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:31,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 531 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-01-09 15:38:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1008. [2025-01-09 15:38:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 931 states have (on average 1.1181525241675618) internal successors, (1041), 933 states have internal predecessors, (1041), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1165 transitions. [2025-01-09 15:38:31,415 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1165 transitions. Word has length 236 [2025-01-09 15:38:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:31,415 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1165 transitions. [2025-01-09 15:38:31,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1165 transitions. [2025-01-09 15:38:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 15:38:31,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:31,417 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:38:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 15:38:31,417 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1036631239, now seen corresponding path program 1 times [2025-01-09 15:38:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030743464] [2025-01-09 15:38:31,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:31,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 15:38:31,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 15:38:31,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-01-09 15:38:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030743464] [2025-01-09 15:38:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030743464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:31,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:38:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702442007] [2025-01-09 15:38:31,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:31,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:38:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:31,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:38:31,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:31,722 INFO L87 Difference]: Start difference. First operand 1008 states and 1165 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:31,860 INFO L93 Difference]: Finished difference Result 1645 states and 1898 transitions. [2025-01-09 15:38:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:38:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-01-09 15:38:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:31,864 INFO L225 Difference]: With dead ends: 1645 [2025-01-09 15:38:31,864 INFO L226 Difference]: Without dead ends: 1051 [2025-01-09 15:38:31,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:31,865 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 84 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:31,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 510 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-09 15:38:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 990. [2025-01-09 15:38:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 913 states have (on average 1.1171960569550932) internal successors, (1020), 915 states have internal predecessors, (1020), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:38:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1144 transitions. [2025-01-09 15:38:31,984 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1144 transitions. Word has length 236 [2025-01-09 15:38:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1144 transitions. [2025-01-09 15:38:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:38:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1144 transitions. [2025-01-09 15:38:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 15:38:31,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:31,986 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-01-09 15:38:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 15:38:31,987 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -668975675, now seen corresponding path program 1 times [2025-01-09 15:38:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986119714] [2025-01-09 15:38:31,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:32,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 15:38:32,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 15:38:32,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-01-09 15:38:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986119714] [2025-01-09 15:38:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986119714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595534115] [2025-01-09 15:38:33,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:33,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:38:33,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 15:38:33,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 15:38:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 15:38:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:33,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 15:38:33,561 INFO L279 TraceCheckSpWp]: Computing forward predicates...