./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:53:48,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:53:48,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:53:48,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:53:48,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:53:48,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:53:48,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:53:48,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:53:48,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:53:48,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:53:48,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:53:48,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:53:48,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:53:48,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:53:48,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:53:48,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:53:48,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:53:48,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:53:48,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:53:48,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 [2025-03-08 16:53:48,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:53:48,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:53:48,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:53:48,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:53:48,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:53:48,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2025-03-08 16:53:49,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c587e1/0f9c8f21257f420394a8587d65d14657/FLAGc554dee55 [2025-03-08 16:53:50,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:53:50,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2025-03-08 16:53:50,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c587e1/0f9c8f21257f420394a8587d65d14657/FLAGc554dee55 [2025-03-08 16:53:50,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c587e1/0f9c8f21257f420394a8587d65d14657 [2025-03-08 16:53:50,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:53:50,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:53:50,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:53:50,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:53:50,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:53:50,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218ff823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50, skipping insertion in model container [2025-03-08 16:53:50,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:53:50,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i[916,929] [2025-03-08 16:53:50,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:53:50,381 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:53:50,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i[916,929] [2025-03-08 16:53:50,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:53:50,437 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:53:50,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50 WrapperNode [2025-03-08 16:53:50,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:53:50,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:53:50,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:53:50,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:53:50,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,495 INFO L138 Inliner]: procedures = 27, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-03-08 16:53:50,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:53:50,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:53:50,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:53:50,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:53:50,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,538 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-08 16:53:50,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:53:50,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:53:50,576 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:53:50,576 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:53:50,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (1/1) ... [2025-03-08 16:53:50,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:53:50,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:50,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:53:50,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:53:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:53:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:53:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:53:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:53:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:53:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:53:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:53:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:53:50,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:53:50,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:53:51,011 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem75#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite100#1;havoc property_#t~mem80#1;havoc property_#t~ite99#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem98#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-08 16:53:51,049 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-08 16:53:51,049 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:53:51,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:53:51,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:53:51,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:53:51 BoogieIcfgContainer [2025-03-08 16:53:51,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:53:51,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:53:51,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:53:51,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:53:51,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:53:50" (1/3) ... [2025-03-08 16:53:51,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b351c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:53:51, skipping insertion in model container [2025-03-08 16:53:51,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:50" (2/3) ... [2025-03-08 16:53:51,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b351c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:53:51, skipping insertion in model container [2025-03-08 16:53:51,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:53:51" (3/3) ... [2025-03-08 16:53:51,065 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-66.i [2025-03-08 16:53:51,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:53:51,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-66.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:53:51,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:53:51,125 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;@65c7e883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:53:51,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:53:51,129 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-03-08 16:53:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:53:51,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:51,137 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:51,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1899672073, now seen corresponding path program 1 times [2025-03-08 16:53:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:51,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301642015] [2025-03-08 16:53:51,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:51,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:53:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:53:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:51,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:53:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301642015] [2025-03-08 16:53:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301642015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878199770] [2025-03-08 16:53:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:51,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:51,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:51,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:51,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:53:51,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:53:51,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:53:51,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:51,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:51,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:53:51,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:53:51,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878199770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:53:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211462847] [2025-03-08 16:53:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:51,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:53:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:51,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:53:51,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:53:51,583 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-03-08 16:53:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:51,606 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2025-03-08 16:53:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:53:51,608 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-03-08 16:53:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:51,613 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:53:51,613 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 16:53:51,617 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-03-08 16:53:51,620 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-03-08 16:53:51,621 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-03-08 16:53:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 16:53:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 16:53:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:53:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-08 16:53:51,655 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2025-03-08 16:53:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-08 16:53:51,656 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-03-08 16:53:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-08 16:53:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:53:51,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:51,659 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:51,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:53:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:53:51,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1908603515, now seen corresponding path program 1 times [2025-03-08 16:53:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-03-08 16:53:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:53:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:53:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:53:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-03-08 16:53:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900449765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:53:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435064068] [2025-03-08 16:53:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:53:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:53:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:52,182 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-03-08 16:53:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:52,219 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2025-03-08 16:53:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:53:52,219 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-03-08 16:53:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:52,221 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:53:52,221 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 16:53:52,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:52,222 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 16:53:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-08 16:53:52,231 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-03-08 16:53:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-08 16:53:52,234 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2025-03-08 16:53:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-08 16:53:52,236 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-03-08 16:53:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-08 16:53:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:53:52,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:52,240 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:53:52,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1498860100, now seen corresponding path program 1 times [2025-03-08 16:53:52,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:52,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519495161] [2025-03-08 16:53:52,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:53:52,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:53:52,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:52,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:53:52,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519495161] [2025-03-08 16:53:52,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519495161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:52,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:52,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:53:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207370244] [2025-03-08 16:53:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:52,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:53:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:52,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:53:52,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:52,414 INFO L87 Difference]: Start difference. First operand 84 states and 120 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-03-08 16:53:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:52,444 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2025-03-08 16:53:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:53:52,448 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-03-08 16:53:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:52,449 INFO L225 Difference]: With dead ends: 168 [2025-03-08 16:53:52,449 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 16:53:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:52,449 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-03-08 16:53:52,450 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-03-08 16:53:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 16:53:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-08 16:53:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:53:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-08 16:53:52,459 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2025-03-08 16:53:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:52,459 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-08 16:53:52,459 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-03-08 16:53:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-08 16:53:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:53:52,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:52,460 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:52,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:53:52,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:52,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1497936579, now seen corresponding path program 1 times [2025-03-08 16:53:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:52,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417925668] [2025-03-08 16:53:52,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:52,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:53:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:53:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:52,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:53:53,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:53,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417925668] [2025-03-08 16:53:53,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417925668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:53,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:53,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:53:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596844607] [2025-03-08 16:53:53,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:53,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:53:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:53,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:53:53,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:53:53,394 INFO L87 Difference]: Start difference. First operand 86 states and 122 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-03-08 16:53:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:53,598 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-08 16:53:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:53:53,599 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-03-08 16:53:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:53,600 INFO L225 Difference]: With dead ends: 252 [2025-03-08 16:53:53,600 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 16:53:53,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:53:53,601 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 75 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:53,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 273 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:53:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 16:53:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-03-08 16:53:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:53:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2025-03-08 16:53:53,624 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 109 [2025-03-08 16:53:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:53,625 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2025-03-08 16:53:53,625 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-03-08 16:53:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2025-03-08 16:53:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:53:53,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:53,629 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-03-08 16:53:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:53:53,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1472843038, now seen corresponding path program 1 times [2025-03-08 16:53:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605210658] [2025-03-08 16:53:53,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:53:53,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:53:53,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:53:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605210658] [2025-03-08 16:53:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605210658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:53:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163570142] [2025-03-08 16:53:56,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:56,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:53:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:56,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:53:56,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:53:56,365 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 16 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:53:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:57,886 INFO L93 Difference]: Finished difference Result 493 states and 698 transitions. [2025-03-08 16:53:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:53:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2025-03-08 16:53:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:57,889 INFO L225 Difference]: With dead ends: 493 [2025-03-08 16:53:57,889 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 16:53:57,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:53:57,890 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 732 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:57,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 774 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:53:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 16:53:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 167. [2025-03-08 16:53:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 136 states have internal predecessors, (181), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:53:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2025-03-08 16:53:57,920 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 110 [2025-03-08 16:53:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:57,920 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2025-03-08 16:53:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:53:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2025-03-08 16:53:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:53:57,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:57,921 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-03-08 16:53:57,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:53:57,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1179440031, now seen corresponding path program 1 times [2025-03-08 16:53:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064812772] [2025-03-08 16:53:57,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:57,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:53:57,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:53:57,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:53:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064812772] [2025-03-08 16:53:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064812772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:53:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864058569] [2025-03-08 16:53:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:53:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:53:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:53:59,042 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:00,012 INFO L93 Difference]: Finished difference Result 416 states and 584 transitions. [2025-03-08 16:54:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:54:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2025-03-08 16:54:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:00,015 INFO L225 Difference]: With dead ends: 416 [2025-03-08 16:54:00,016 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 16:54:00,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:54:00,017 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 270 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:00,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 632 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:54:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 16:54:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 257. [2025-03-08 16:54:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 220 states have (on average 1.3545454545454545) internal successors, (298), 222 states have internal predecessors, (298), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:54:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 362 transitions. [2025-03-08 16:54:00,048 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 362 transitions. Word has length 110 [2025-03-08 16:54:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 362 transitions. [2025-03-08 16:54:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 362 transitions. [2025-03-08 16:54:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:54:00,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:00,051 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-03-08 16:54:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:54:00,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1468814561, now seen corresponding path program 1 times [2025-03-08 16:54:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329865349] [2025-03-08 16:54:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:00,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:54:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:54:00,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329865349] [2025-03-08 16:54:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329865349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810338756] [2025-03-08 16:54:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:00,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:00,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:00,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:00,658 INFO L87 Difference]: Start difference. First operand 257 states and 362 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:01,170 INFO L93 Difference]: Finished difference Result 607 states and 853 transitions. [2025-03-08 16:54:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (14), 1 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 110 [2025-03-08 16:54:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:01,173 INFO L225 Difference]: With dead ends: 607 [2025-03-08 16:54:01,174 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 16:54:01,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:01,177 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 211 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:01,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 321 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 16:54:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 285. [2025-03-08 16:54:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 235 states have (on average 1.323404255319149) internal successors, (311), 237 states have internal predecessors, (311), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:54:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 399 transitions. [2025-03-08 16:54:01,204 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 399 transitions. Word has length 110 [2025-03-08 16:54:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:01,205 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 399 transitions. [2025-03-08 16:54:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 399 transitions. [2025-03-08 16:54:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:54:01,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:01,206 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-03-08 16:54:01,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:54:01,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1762217568, now seen corresponding path program 1 times [2025-03-08 16:54:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994217474] [2025-03-08 16:54:01,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:01,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:54:01,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:54:01,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:01,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:01,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994217474] [2025-03-08 16:54:01,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994217474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:01,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005167300] [2025-03-08 16:54:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:01,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:01,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:01,602 INFO L87 Difference]: Start difference. First operand 285 states and 399 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:01,972 INFO L93 Difference]: Finished difference Result 595 states and 815 transitions. [2025-03-08 16:54:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:01,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 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 110 [2025-03-08 16:54:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:01,975 INFO L225 Difference]: With dead ends: 595 [2025-03-08 16:54:01,975 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 16:54:01,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:01,976 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 189 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:01,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 255 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 16:54:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 279. [2025-03-08 16:54:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 235 states have (on average 1.323404255319149) internal successors, (311), 237 states have internal predecessors, (311), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 383 transitions. [2025-03-08 16:54:02,007 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 383 transitions. Word has length 110 [2025-03-08 16:54:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:02,007 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 383 transitions. [2025-03-08 16:54:02,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 383 transitions. [2025-03-08 16:54:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 16:54:02,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:02,008 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:02,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:54:02,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash 851281888, now seen corresponding path program 1 times [2025-03-08 16:54:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489768042] [2025-03-08 16:54:02,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 16:54:02,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 16:54:02,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:02,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489768042] [2025-03-08 16:54:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489768042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:54:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880955704] [2025-03-08 16:54:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:54:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:03,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:54:03,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:03,144 INFO L87 Difference]: Start difference. First operand 279 states and 383 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:03,993 INFO L93 Difference]: Finished difference Result 608 states and 829 transitions. [2025-03-08 16:54:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:54:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2025-03-08 16:54:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:03,995 INFO L225 Difference]: With dead ends: 608 [2025-03-08 16:54:03,995 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 16:54:03,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:54:03,996 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 284 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:03,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 648 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:54:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 16:54:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 279. [2025-03-08 16:54:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 237 states have internal predecessors, (309), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 381 transitions. [2025-03-08 16:54:04,017 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 381 transitions. Word has length 111 [2025-03-08 16:54:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:04,017 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 381 transitions. [2025-03-08 16:54:04,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 381 transitions. [2025-03-08 16:54:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 16:54:04,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:04,019 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:54:04,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:04,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -286592990, now seen corresponding path program 1 times [2025-03-08 16:54:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:04,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942302105] [2025-03-08 16:54:04,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:04,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 16:54:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 16:54:04,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:04,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942302105] [2025-03-08 16:54:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942302105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:54:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691567567] [2025-03-08 16:54:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:04,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:04,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:04,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:54:04,396 INFO L87 Difference]: Start difference. First operand 279 states and 381 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:04,543 INFO L93 Difference]: Finished difference Result 509 states and 695 transitions. [2025-03-08 16:54:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-08 16:54:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:04,545 INFO L225 Difference]: With dead ends: 509 [2025-03-08 16:54:04,545 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 16:54:04,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:04,545 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:04,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 273 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 16:54:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2025-03-08 16:54:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.303191489361702) internal successors, (245), 189 states have internal predecessors, (245), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 305 transitions. [2025-03-08 16:54:04,571 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 305 transitions. Word has length 111 [2025-03-08 16:54:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:04,571 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 305 transitions. [2025-03-08 16:54:04,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 305 transitions. [2025-03-08 16:54:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 16:54:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:04,573 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:54:04,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -382758015, now seen corresponding path program 1 times [2025-03-08 16:54:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874391006] [2025-03-08 16:54:04,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:04,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 16:54:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 16:54:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874391006] [2025-03-08 16:54:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874391006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:54:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927088943] [2025-03-08 16:54:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:54:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:05,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:54:05,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:05,616 INFO L87 Difference]: Start difference. First operand 225 states and 305 transitions. Second operand has 9 states, 6 states have (on average 7.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:05,939 INFO L93 Difference]: Finished difference Result 401 states and 547 transitions. [2025-03-08 16:54:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:54:05,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 112 [2025-03-08 16:54:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:05,942 INFO L225 Difference]: With dead ends: 401 [2025-03-08 16:54:05,942 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 16:54:05,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:05,944 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 48 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:05,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 518 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 16:54:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 227. [2025-03-08 16:54:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.3) internal successors, (247), 191 states have internal predecessors, (247), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 307 transitions. [2025-03-08 16:54:05,965 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 307 transitions. Word has length 112 [2025-03-08 16:54:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:05,965 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 307 transitions. [2025-03-08 16:54:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2025-03-08 16:54:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 16:54:05,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:05,968 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:05,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:54:05,968 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash -676161022, now seen corresponding path program 1 times [2025-03-08 16:54:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039332935] [2025-03-08 16:54:05,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:05,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:05,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 16:54:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 16:54:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039332935] [2025-03-08 16:54:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039332935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530258206] [2025-03-08 16:54:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:06,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:06,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:06,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:06,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:06,454 INFO L87 Difference]: Start difference. First operand 227 states and 307 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:06,817 INFO L93 Difference]: Finished difference Result 436 states and 592 transitions. [2025-03-08 16:54:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 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 112 [2025-03-08 16:54:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:06,820 INFO L225 Difference]: With dead ends: 436 [2025-03-08 16:54:06,821 INFO L226 Difference]: Without dead ends: 295 [2025-03-08 16:54:06,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:06,823 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 181 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:06,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 275 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-08 16:54:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 225. [2025-03-08 16:54:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 189 states have internal predecessors, (243), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 303 transitions. [2025-03-08 16:54:06,846 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 303 transitions. Word has length 112 [2025-03-08 16:54:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:06,846 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 303 transitions. [2025-03-08 16:54:06,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 303 transitions. [2025-03-08 16:54:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:54:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:06,848 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:06,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:54:06,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:06,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 17202459, now seen corresponding path program 1 times [2025-03-08 16:54:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016453202] [2025-03-08 16:54:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:06,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:54:06,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:54:06,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:06,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016453202] [2025-03-08 16:54:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016453202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:07,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:07,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358234231] [2025-03-08 16:54:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:07,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:07,549 INFO L87 Difference]: Start difference. First operand 225 states and 303 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:07,792 INFO L93 Difference]: Finished difference Result 397 states and 538 transitions. [2025-03-08 16:54:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-08 16:54:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:07,794 INFO L225 Difference]: With dead ends: 397 [2025-03-08 16:54:07,794 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 16:54:07,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:07,794 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 46 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 602 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 16:54:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 223. [2025-03-08 16:54:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 186 states have (on average 1.2903225806451613) internal successors, (240), 187 states have internal predecessors, (240), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 300 transitions. [2025-03-08 16:54:07,830 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 300 transitions. Word has length 113 [2025-03-08 16:54:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 300 transitions. [2025-03-08 16:54:07,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 300 transitions. [2025-03-08 16:54:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 16:54:07,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:07,831 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:07,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:54:07,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:07,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 945209620, now seen corresponding path program 1 times [2025-03-08 16:54:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255161539] [2025-03-08 16:54:07,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:07,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:54:07,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:54:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-08 16:54:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255161539] [2025-03-08 16:54:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255161539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:07,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830150476] [2025-03-08 16:54:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:07,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:54:07,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:54:08,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 16:54:08,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 16:54:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:08,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:54:08,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:08,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830150476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:54:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768199387] [2025-03-08 16:54:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:08,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:08,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:08,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:08,072 INFO L87 Difference]: Start difference. First operand 223 states and 300 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:08,100 INFO L93 Difference]: Finished difference Result 452 states and 609 transitions. [2025-03-08 16:54:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:54:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-08 16:54:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:08,101 INFO L225 Difference]: With dead ends: 452 [2025-03-08 16:54:08,102 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 16:54:08,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:08,102 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-03-08 16:54:08,102 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-03-08 16:54:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 16:54:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-08 16:54:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 195 states have (on average 1.2769230769230768) internal successors, (249), 196 states have internal predecessors, (249), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2025-03-08 16:54:08,118 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 113 [2025-03-08 16:54:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:08,119 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2025-03-08 16:54:08,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2025-03-08 16:54:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:54:08,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:08,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] [2025-03-08 16:54:08,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:54:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 16:54:08,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:08,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1809181398, now seen corresponding path program 1 times [2025-03-08 16:54:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092103934] [2025-03-08 16:54:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:08,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:54:08,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:54:08,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:08,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092103934] [2025-03-08 16:54:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092103934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:54:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393306554] [2025-03-08 16:54:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:54:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:08,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:54:08,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:08,908 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:09,532 INFO L93 Difference]: Finished difference Result 681 states and 914 transitions. [2025-03-08 16:54:09,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:54:09,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 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 115 [2025-03-08 16:54:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:09,535 INFO L225 Difference]: With dead ends: 681 [2025-03-08 16:54:09,535 INFO L226 Difference]: Without dead ends: 452 [2025-03-08 16:54:09,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:54:09,536 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 374 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:09,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 434 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:54:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-08 16:54:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 252. [2025-03-08 16:54:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 216 states have internal predecessors, (273), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 333 transitions. [2025-03-08 16:54:09,557 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 333 transitions. Word has length 115 [2025-03-08 16:54:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 333 transitions. [2025-03-08 16:54:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 333 transitions. [2025-03-08 16:54:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:54:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:09,558 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:54:09,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -978234089, now seen corresponding path program 1 times [2025-03-08 16:54:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-08 16:54:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:54:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:54:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-08 16:54:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819765268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268425530] [2025-03-08 16:54:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:10,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:10,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:10,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:10,008 INFO L87 Difference]: Start difference. First operand 252 states and 333 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:10,326 INFO L93 Difference]: Finished difference Result 534 states and 705 transitions. [2025-03-08 16:54:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:54:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 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 115 [2025-03-08 16:54:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:10,328 INFO L225 Difference]: With dead ends: 534 [2025-03-08 16:54:10,328 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 16:54:10,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:10,330 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 65 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:10,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 622 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 16:54:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 274. [2025-03-08 16:54:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 238 states have internal predecessors, (304), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 364 transitions. [2025-03-08 16:54:10,352 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 364 transitions. Word has length 115 [2025-03-08 16:54:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 364 transitions. [2025-03-08 16:54:10,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 364 transitions. [2025-03-08 16:54:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:54:10,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:10,354 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:10,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:54:10,354 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 556964180, now seen corresponding path program 1 times [2025-03-08 16:54:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669664061] [2025-03-08 16:54:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:10,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:54:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:54:10,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:10,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669664061] [2025-03-08 16:54:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669664061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:10,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43568120] [2025-03-08 16:54:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:10,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:10,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:10,709 INFO L87 Difference]: Start difference. First operand 274 states and 364 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:10,920 INFO L93 Difference]: Finished difference Result 660 states and 875 transitions. [2025-03-08 16:54:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 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 116 [2025-03-08 16:54:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:10,923 INFO L225 Difference]: With dead ends: 660 [2025-03-08 16:54:10,923 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 16:54:10,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:10,924 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 345 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 16:54:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2025-03-08 16:54:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 340 states have (on average 1.285294117647059) internal successors, (437), 343 states have internal predecessors, (437), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 509 transitions. [2025-03-08 16:54:10,950 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 509 transitions. Word has length 116 [2025-03-08 16:54:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:10,950 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 509 transitions. [2025-03-08 16:54:10,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 509 transitions. [2025-03-08 16:54:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:54:10,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:10,951 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:10,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:54:10,952 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:10,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1443348238, now seen corresponding path program 1 times [2025-03-08 16:54:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731819163] [2025-03-08 16:54:10,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:10,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:54:10,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:54:10,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:10,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:11,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:11,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731819163] [2025-03-08 16:54:11,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731819163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:11,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:54:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639722015] [2025-03-08 16:54:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:11,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:11,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:11,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:54:11,335 INFO L87 Difference]: Start difference. First operand 386 states and 509 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-03-08 16:54:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:11,483 INFO L93 Difference]: Finished difference Result 776 states and 1024 transitions. [2025-03-08 16:54:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-03-08 16:54:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:11,487 INFO L225 Difference]: With dead ends: 776 [2025-03-08 16:54:11,487 INFO L226 Difference]: Without dead ends: 393 [2025-03-08 16:54:11,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:11,488 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:11,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 224 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-08 16:54:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 386. [2025-03-08 16:54:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 340 states have (on average 1.2823529411764707) internal successors, (436), 343 states have internal predecessors, (436), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 508 transitions. [2025-03-08 16:54:11,515 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 508 transitions. Word has length 116 [2025-03-08 16:54:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:11,516 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 508 transitions. [2025-03-08 16:54:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-03-08 16:54:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 508 transitions. [2025-03-08 16:54:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:54:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:11,517 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:11,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:54:11,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2064515989, now seen corresponding path program 1 times [2025-03-08 16:54:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413763831] [2025-03-08 16:54:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:54:11,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:54:11,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:11,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413763831] [2025-03-08 16:54:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413763831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:11,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898281684] [2025-03-08 16:54:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:11,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:11,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:11,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:11,754 INFO L87 Difference]: Start difference. First operand 386 states and 508 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:11,946 INFO L93 Difference]: Finished difference Result 733 states and 961 transitions. [2025-03-08 16:54:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 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 116 [2025-03-08 16:54:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:11,949 INFO L225 Difference]: With dead ends: 733 [2025-03-08 16:54:11,949 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 16:54:11,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:11,950 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 28 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:11,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 410 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 16:54:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2025-03-08 16:54:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 301 states have (on average 1.2591362126245846) internal successors, (379), 304 states have internal predecessors, (379), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 451 transitions. [2025-03-08 16:54:11,973 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 451 transitions. Word has length 116 [2025-03-08 16:54:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:11,973 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 451 transitions. [2025-03-08 16:54:11,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 451 transitions. [2025-03-08 16:54:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:54:11,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:11,974 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:54:11,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:11,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1102098387, now seen corresponding path program 1 times [2025-03-08 16:54:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877238898] [2025-03-08 16:54:11,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:11,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:54:12,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:54:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:12,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877238898] [2025-03-08 16:54:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877238898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396979711] [2025-03-08 16:54:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:12,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:12,548 INFO L87 Difference]: Start difference. First operand 347 states and 451 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:12,815 INFO L93 Difference]: Finished difference Result 390 states and 501 transitions. [2025-03-08 16:54:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 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 117 [2025-03-08 16:54:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:12,817 INFO L225 Difference]: With dead ends: 390 [2025-03-08 16:54:12,817 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 16:54:12,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:12,818 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 62 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:12,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 438 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 16:54:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 362. [2025-03-08 16:54:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 316 states have (on average 1.2468354430379747) internal successors, (394), 319 states have internal predecessors, (394), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:54:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 466 transitions. [2025-03-08 16:54:12,845 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 466 transitions. Word has length 117 [2025-03-08 16:54:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:12,846 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 466 transitions. [2025-03-08 16:54:12,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 466 transitions. [2025-03-08 16:54:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:54:12,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:12,847 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:12,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:54:12,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1103021908, now seen corresponding path program 1 times [2025-03-08 16:54:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668029576] [2025-03-08 16:54:12,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:12,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:54:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:54:12,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:12,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:13,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:13,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668029576] [2025-03-08 16:54:13,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668029576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:13,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26433696] [2025-03-08 16:54:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:13,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:13,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:13,223 INFO L87 Difference]: Start difference. First operand 362 states and 466 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:13,482 INFO L93 Difference]: Finished difference Result 767 states and 982 transitions. [2025-03-08 16:54:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 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 117 [2025-03-08 16:54:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:13,486 INFO L225 Difference]: With dead ends: 767 [2025-03-08 16:54:13,486 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 16:54:13,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:13,487 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 77 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 393 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 16:54:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 407. [2025-03-08 16:54:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 344 states have (on average 1.2122093023255813) internal successors, (417), 348 states have internal predecessors, (417), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:54:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 513 transitions. [2025-03-08 16:54:13,520 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 513 transitions. Word has length 117 [2025-03-08 16:54:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 513 transitions. [2025-03-08 16:54:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 513 transitions. [2025-03-08 16:54:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:54:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:13,521 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:54:13,522 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1990525589, now seen corresponding path program 1 times [2025-03-08 16:54:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65769393] [2025-03-08 16:54:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:13,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:54:13,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:54:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65769393] [2025-03-08 16:54:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65769393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:14,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:14,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380810730] [2025-03-08 16:54:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:14,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:14,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:14,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:14,127 INFO L87 Difference]: Start difference. First operand 407 states and 513 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:14,343 INFO L93 Difference]: Finished difference Result 751 states and 952 transitions. [2025-03-08 16:54:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 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 117 [2025-03-08 16:54:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:14,347 INFO L225 Difference]: With dead ends: 751 [2025-03-08 16:54:14,347 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 16:54:14,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:14,350 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 37 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:14,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 517 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 16:54:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 444. [2025-03-08 16:54:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 381 states have (on average 1.2152230971128608) internal successors, (463), 385 states have internal predecessors, (463), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:54:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 559 transitions. [2025-03-08 16:54:14,386 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 559 transitions. Word has length 117 [2025-03-08 16:54:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:14,386 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 559 transitions. [2025-03-08 16:54:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 559 transitions. [2025-03-08 16:54:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:54:14,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:14,388 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:14,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:54:14,388 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 751899707, now seen corresponding path program 1 times [2025-03-08 16:54:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310259523] [2025-03-08 16:54:14,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:14,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:54:14,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:54:14,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:14,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310259523] [2025-03-08 16:54:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310259523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:14,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:14,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055688186] [2025-03-08 16:54:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:14,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:14,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:14,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:14,663 INFO L87 Difference]: Start difference. First operand 444 states and 559 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:15,068 INFO L93 Difference]: Finished difference Result 973 states and 1242 transitions. [2025-03-08 16:54:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:54:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-08 16:54:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:15,071 INFO L225 Difference]: With dead ends: 973 [2025-03-08 16:54:15,071 INFO L226 Difference]: Without dead ends: 671 [2025-03-08 16:54:15,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:15,072 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 177 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:15,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 429 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-08 16:54:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 490. [2025-03-08 16:54:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 424 states have (on average 1.2311320754716981) internal successors, (522), 428 states have internal predecessors, (522), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 622 transitions. [2025-03-08 16:54:15,107 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 622 transitions. Word has length 118 [2025-03-08 16:54:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 622 transitions. [2025-03-08 16:54:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 622 transitions. [2025-03-08 16:54:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:54:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:15,110 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:54:15,110 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2035515780, now seen corresponding path program 1 times [2025-03-08 16:54:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879632649] [2025-03-08 16:54:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:15,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:54:15,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:54:15,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:15,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879632649] [2025-03-08 16:54:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879632649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:54:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506769403] [2025-03-08 16:54:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:54:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:15,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:54:15,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:15,524 INFO L87 Difference]: Start difference. First operand 490 states and 622 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:16,145 INFO L93 Difference]: Finished difference Result 1005 states and 1275 transitions. [2025-03-08 16:54:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:54:16,146 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), 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 118 [2025-03-08 16:54:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:16,149 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 16:54:16,149 INFO L226 Difference]: Without dead ends: 703 [2025-03-08 16:54:16,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:54:16,150 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 482 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:16,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 557 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:54:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-08 16:54:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 490. [2025-03-08 16:54:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 424 states have (on average 1.224056603773585) internal successors, (519), 428 states have internal predecessors, (519), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 619 transitions. [2025-03-08 16:54:16,187 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 619 transitions. Word has length 118 [2025-03-08 16:54:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:16,187 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 619 transitions. [2025-03-08 16:54:16,187 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 619 transitions. [2025-03-08 16:54:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:54:16,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:16,188 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:16,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:54:16,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:16,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1966805366, now seen corresponding path program 1 times [2025-03-08 16:54:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238145142] [2025-03-08 16:54:16,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:16,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:54:16,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:54:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238145142] [2025-03-08 16:54:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238145142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399614140] [2025-03-08 16:54:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:16,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:16,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:16,525 INFO L87 Difference]: Start difference. First operand 490 states and 619 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:17,022 INFO L93 Difference]: Finished difference Result 1008 states and 1273 transitions. [2025-03-08 16:54:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:54:17,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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 118 [2025-03-08 16:54:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:17,025 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 16:54:17,025 INFO L226 Difference]: Without dead ends: 706 [2025-03-08 16:54:17,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:54:17,026 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 259 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 443 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-08 16:54:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 495. [2025-03-08 16:54:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 429 states have (on average 1.2214452214452214) internal successors, (524), 433 states have internal predecessors, (524), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 624 transitions. [2025-03-08 16:54:17,061 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 624 transitions. Word has length 118 [2025-03-08 16:54:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 624 transitions. [2025-03-08 16:54:17,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 624 transitions. [2025-03-08 16:54:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:54:17,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:17,062 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:17,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:54:17,063 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash -831990062, now seen corresponding path program 1 times [2025-03-08 16:54:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995778015] [2025-03-08 16:54:17,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:54:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:54:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995778015] [2025-03-08 16:54:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995778015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336286288] [2025-03-08 16:54:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:17,666 INFO L87 Difference]: Start difference. First operand 495 states and 624 transitions. Second operand has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:17,898 INFO L93 Difference]: Finished difference Result 860 states and 1084 transitions. [2025-03-08 16:54:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 16:54:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:17,900 INFO L225 Difference]: With dead ends: 860 [2025-03-08 16:54:17,900 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 16:54:17,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:17,901 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 45 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 468 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 16:54:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 462. [2025-03-08 16:54:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 396 states have (on average 1.2095959595959596) internal successors, (479), 400 states have internal predecessors, (479), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 579 transitions. [2025-03-08 16:54:17,939 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 579 transitions. Word has length 119 [2025-03-08 16:54:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:17,939 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 579 transitions. [2025-03-08 16:54:17,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 579 transitions. [2025-03-08 16:54:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:54:17,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:17,940 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:17,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:54:17,942 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:17,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1315440007, now seen corresponding path program 1 times [2025-03-08 16:54:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:17,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079877451] [2025-03-08 16:54:17,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:17,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:54:17,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:54:17,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079877451] [2025-03-08 16:54:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079877451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:18,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:18,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756466441] [2025-03-08 16:54:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:18,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:18,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:18,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:18,518 INFO L87 Difference]: Start difference. First operand 462 states and 579 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:18,875 INFO L93 Difference]: Finished difference Result 975 states and 1218 transitions. [2025-03-08 16:54:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:18,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:54:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:18,878 INFO L225 Difference]: With dead ends: 975 [2025-03-08 16:54:18,878 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 16:54:18,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:18,879 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 131 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:18,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 667 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 16:54:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 478. [2025-03-08 16:54:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 412 states have (on average 1.2063106796116505) internal successors, (497), 416 states have internal predecessors, (497), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 597 transitions. [2025-03-08 16:54:18,917 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 597 transitions. Word has length 119 [2025-03-08 16:54:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 597 transitions. [2025-03-08 16:54:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 597 transitions. [2025-03-08 16:54:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:54:18,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:18,918 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:54:18,919 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1182575930, now seen corresponding path program 1 times [2025-03-08 16:54:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019387738] [2025-03-08 16:54:18,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:18,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:54:18,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:54:18,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019387738] [2025-03-08 16:54:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019387738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375074282] [2025-03-08 16:54:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:19,305 INFO L87 Difference]: Start difference. First operand 478 states and 597 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:19,643 INFO L93 Difference]: Finished difference Result 1094 states and 1369 transitions. [2025-03-08 16:54:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:54:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:19,646 INFO L225 Difference]: With dead ends: 1094 [2025-03-08 16:54:19,646 INFO L226 Difference]: Without dead ends: 664 [2025-03-08 16:54:19,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:19,647 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 226 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 462 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-08 16:54:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 599. [2025-03-08 16:54:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 533 states have (on average 1.2195121951219512) internal successors, (650), 536 states have internal predecessors, (650), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 750 transitions. [2025-03-08 16:54:19,686 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 750 transitions. Word has length 119 [2025-03-08 16:54:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:19,686 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 750 transitions. [2025-03-08 16:54:19,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 750 transitions. [2025-03-08 16:54:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:54:19,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:54:19,688 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -70675526, now seen corresponding path program 1 times [2025-03-08 16:54:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391140094] [2025-03-08 16:54:19,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:19,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:54:19,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:54:19,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:19,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:19,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391140094] [2025-03-08 16:54:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391140094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:19,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112344753] [2025-03-08 16:54:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:19,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:19,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:19,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:19,964 INFO L87 Difference]: Start difference. First operand 599 states and 750 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:20,250 INFO L93 Difference]: Finished difference Result 1130 states and 1408 transitions. [2025-03-08 16:54:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-08 16:54:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:20,253 INFO L225 Difference]: With dead ends: 1130 [2025-03-08 16:54:20,253 INFO L226 Difference]: Without dead ends: 652 [2025-03-08 16:54:20,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:20,255 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 153 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:20,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 323 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-08 16:54:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 597. [2025-03-08 16:54:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 531 states have (on average 1.2109227871939736) internal successors, (643), 534 states have internal predecessors, (643), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:54:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 743 transitions. [2025-03-08 16:54:20,311 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 743 transitions. Word has length 119 [2025-03-08 16:54:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:20,312 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 743 transitions. [2025-03-08 16:54:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:54:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 743 transitions. [2025-03-08 16:54:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:54:20,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:20,313 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] [2025-03-08 16:54:20,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:54:20,313 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:20,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1302161516, now seen corresponding path program 1 times [2025-03-08 16:54:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261592590] [2025-03-08 16:54:20,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:54:20,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:54:20,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261592590] [2025-03-08 16:54:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261592590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:21,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119714687] [2025-03-08 16:54:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:21,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:21,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:21,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:21,038 INFO L87 Difference]: Start difference. First operand 597 states and 743 transitions. Second operand has 8 states, 5 states have (on average 10.6) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:21,262 INFO L93 Difference]: Finished difference Result 878 states and 1089 transitions. [2025-03-08 16:54:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 10.6) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120 [2025-03-08 16:54:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:21,264 INFO L225 Difference]: With dead ends: 878 [2025-03-08 16:54:21,264 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 16:54:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:21,265 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 37 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:21,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 502 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 16:54:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 518. [2025-03-08 16:54:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 456 states have (on average 1.2083333333333333) internal successors, (551), 457 states have internal predecessors, (551), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:54:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 643 transitions. [2025-03-08 16:54:21,315 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 643 transitions. Word has length 120 [2025-03-08 16:54:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:21,315 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 643 transitions. [2025-03-08 16:54:21,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 10.6) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 643 transitions. [2025-03-08 16:54:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:54:21,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:21,316 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:21,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:54:21,316 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:21,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash 480202706, now seen corresponding path program 1 times [2025-03-08 16:54:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899330864] [2025-03-08 16:54:21,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:21,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:54:21,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:54:21,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:21,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899330864] [2025-03-08 16:54:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899330864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:54:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426939180] [2025-03-08 16:54:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:54:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:22,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:54:22,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:54:22,957 INFO L87 Difference]: Start difference. First operand 518 states and 643 transitions. Second operand has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:24,185 INFO L93 Difference]: Finished difference Result 978 states and 1215 transitions. [2025-03-08 16:54:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:54:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2025-03-08 16:54:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:24,188 INFO L225 Difference]: With dead ends: 978 [2025-03-08 16:54:24,188 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 16:54:24,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:54:24,191 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 190 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:24,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1308 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:54:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 16:54:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 619. [2025-03-08 16:54:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 546 states have (on average 1.206959706959707) internal successors, (659), 548 states have internal predecessors, (659), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:54:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 767 transitions. [2025-03-08 16:54:24,277 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 767 transitions. Word has length 121 [2025-03-08 16:54:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 767 transitions. [2025-03-08 16:54:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 767 transitions. [2025-03-08 16:54:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:54:24,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:24,278 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] [2025-03-08 16:54:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:54:24,282 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:24,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 3800631, now seen corresponding path program 1 times [2025-03-08 16:54:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296412922] [2025-03-08 16:54:24,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:24,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:54:24,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:54:24,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:24,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296412922] [2025-03-08 16:54:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296412922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:24,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:54:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98657621] [2025-03-08 16:54:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:54:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:25,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:54:25,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:25,000 INFO L87 Difference]: Start difference. First operand 619 states and 767 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:25,417 INFO L93 Difference]: Finished difference Result 1210 states and 1497 transitions. [2025-03-08 16:54:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:54:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (14), 1 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 122 [2025-03-08 16:54:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:25,420 INFO L225 Difference]: With dead ends: 1210 [2025-03-08 16:54:25,420 INFO L226 Difference]: Without dead ends: 892 [2025-03-08 16:54:25,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:54:25,421 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 88 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:25,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 965 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-08 16:54:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 687. [2025-03-08 16:54:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 614 states have (on average 1.208469055374593) internal successors, (742), 616 states have internal predecessors, (742), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:54:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 850 transitions. [2025-03-08 16:54:25,477 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 850 transitions. Word has length 122 [2025-03-08 16:54:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:25,478 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 850 transitions. [2025-03-08 16:54:25,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 850 transitions. [2025-03-08 16:54:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:25,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:25,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-03-08 16:54:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:54:25,479 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1273458415, now seen corresponding path program 1 times [2025-03-08 16:54:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908953834] [2025-03-08 16:54:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:25,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908953834] [2025-03-08 16:54:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908953834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:54:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354602034] [2025-03-08 16:54:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:26,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:54:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:26,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:54:26,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:26,351 INFO L87 Difference]: Start difference. First operand 687 states and 850 transitions. Second operand has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:26,854 INFO L93 Difference]: Finished difference Result 1325 states and 1652 transitions. [2025-03-08 16:54:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:54:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-03-08 16:54:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:26,857 INFO L225 Difference]: With dead ends: 1325 [2025-03-08 16:54:26,857 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 16:54:26,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:26,858 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:26,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 607 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 16:54:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 798. [2025-03-08 16:54:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 725 states have (on average 1.230344827586207) internal successors, (892), 727 states have internal predecessors, (892), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:54:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1000 transitions. [2025-03-08 16:54:26,914 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1000 transitions. Word has length 123 [2025-03-08 16:54:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1000 transitions. [2025-03-08 16:54:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1000 transitions. [2025-03-08 16:54:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:26,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:26,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, 1, 1, 1, 1] [2025-03-08 16:54:26,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:54:26,915 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:26,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1668199184, now seen corresponding path program 1 times [2025-03-08 16:54:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606189239] [2025-03-08 16:54:26,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:26,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:26,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:26,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:26,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:27,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:27,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606189239] [2025-03-08 16:54:27,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606189239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:27,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:27,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907167120] [2025-03-08 16:54:27,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:27,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:27,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:27,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:27,441 INFO L87 Difference]: Start difference. First operand 798 states and 1000 transitions. Second operand has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:27,611 INFO L93 Difference]: Finished difference Result 1235 states and 1560 transitions. [2025-03-08 16:54:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-08 16:54:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:27,614 INFO L225 Difference]: With dead ends: 1235 [2025-03-08 16:54:27,614 INFO L226 Difference]: Without dead ends: 808 [2025-03-08 16:54:27,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:27,615 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:27,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 438 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-08 16:54:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-03-08 16:54:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 735 states have (on average 1.2340136054421769) internal successors, (907), 737 states have internal predecessors, (907), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:54:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1015 transitions. [2025-03-08 16:54:27,663 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1015 transitions. Word has length 123 [2025-03-08 16:54:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1015 transitions. [2025-03-08 16:54:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1015 transitions. [2025-03-08 16:54:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:27,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:27,665 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:54:27,665 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash -160647375, now seen corresponding path program 1 times [2025-03-08 16:54:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124950539] [2025-03-08 16:54:27,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:27,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:27,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:27,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124950539] [2025-03-08 16:54:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124950539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:28,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:28,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:54:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902409353] [2025-03-08 16:54:28,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:28,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:54:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:54:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:54:28,526 INFO L87 Difference]: Start difference. First operand 808 states and 1015 transitions. Second operand has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:29,484 INFO L93 Difference]: Finished difference Result 1509 states and 1883 transitions. [2025-03-08 16:54:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:54:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) Word has length 123 [2025-03-08 16:54:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:29,488 INFO L225 Difference]: With dead ends: 1509 [2025-03-08 16:54:29,488 INFO L226 Difference]: Without dead ends: 1073 [2025-03-08 16:54:29,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:54:29,490 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 359 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:29,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 753 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:54:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-08 16:54:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 856. [2025-03-08 16:54:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 782 states have (on average 1.2352941176470589) internal successors, (966), 784 states have internal predecessors, (966), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:54:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1074 transitions. [2025-03-08 16:54:29,543 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1074 transitions. Word has length 123 [2025-03-08 16:54:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:29,543 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1074 transitions. [2025-03-08 16:54:29,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.090909090909091) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1074 transitions. [2025-03-08 16:54:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:29,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:29,544 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:29,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:54:29,544 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:29,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1739599755, now seen corresponding path program 1 times [2025-03-08 16:54:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:29,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217691438] [2025-03-08 16:54:29,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:29,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217691438] [2025-03-08 16:54:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217691438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:54:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876457559] [2025-03-08 16:54:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:30,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:54:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:30,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:54:30,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:30,133 INFO L87 Difference]: Start difference. First operand 856 states and 1074 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:30,544 INFO L93 Difference]: Finished difference Result 1554 states and 1933 transitions. [2025-03-08 16:54:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:54:30,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 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 123 [2025-03-08 16:54:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:30,548 INFO L225 Difference]: With dead ends: 1554 [2025-03-08 16:54:30,548 INFO L226 Difference]: Without dead ends: 1004 [2025-03-08 16:54:30,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:54:30,549 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 270 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:30,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 557 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-08 16:54:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 900. [2025-03-08 16:54:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 820 states have (on average 1.223170731707317) internal successors, (1003), 823 states have internal predecessors, (1003), 58 states have call successors, (58), 21 states have call predecessors, (58), 21 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:54:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1119 transitions. [2025-03-08 16:54:30,621 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1119 transitions. Word has length 123 [2025-03-08 16:54:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:30,621 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1119 transitions. [2025-03-08 16:54:30,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1119 transitions. [2025-03-08 16:54:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:30,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:30,622 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:54:30,625 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:30,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1806606508, now seen corresponding path program 1 times [2025-03-08 16:54:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407381583] [2025-03-08 16:54:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407381583] [2025-03-08 16:54:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407381583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:54:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018952904] [2025-03-08 16:54:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:54:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:54:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:54:31,341 INFO L87 Difference]: Start difference. First operand 900 states and 1119 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:31,893 INFO L93 Difference]: Finished difference Result 1598 states and 1988 transitions. [2025-03-08 16:54:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:54:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-08 16:54:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:31,896 INFO L225 Difference]: With dead ends: 1598 [2025-03-08 16:54:31,896 INFO L226 Difference]: Without dead ends: 1144 [2025-03-08 16:54:31,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:54:31,897 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 70 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:31,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1253 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-08 16:54:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1015. [2025-03-08 16:54:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 935 states have (on average 1.2331550802139037) internal successors, (1153), 938 states have internal predecessors, (1153), 58 states have call successors, (58), 21 states have call predecessors, (58), 21 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:54:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1269 transitions. [2025-03-08 16:54:31,983 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1269 transitions. Word has length 123 [2025-03-08 16:54:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:31,983 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1269 transitions. [2025-03-08 16:54:31,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1269 transitions. [2025-03-08 16:54:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:31,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:31,984 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:31,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:54:31,984 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:31,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2000303023, now seen corresponding path program 1 times [2025-03-08 16:54:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590946206] [2025-03-08 16:54:31,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:32,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:32,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:32,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:32,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590946206] [2025-03-08 16:54:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590946206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:54:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116113516] [2025-03-08 16:54:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:32,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:54:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:32,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:54:32,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:32,760 INFO L87 Difference]: Start difference. First operand 1015 states and 1269 transitions. Second operand has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:33,261 INFO L93 Difference]: Finished difference Result 1818 states and 2290 transitions. [2025-03-08 16:54:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:54:33,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-03-08 16:54:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:33,265 INFO L225 Difference]: With dead ends: 1818 [2025-03-08 16:54:33,265 INFO L226 Difference]: Without dead ends: 1299 [2025-03-08 16:54:33,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:33,266 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 62 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:33,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 772 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-08 16:54:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1122. [2025-03-08 16:54:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1042 states have (on average 1.2418426103646834) internal successors, (1294), 1045 states have internal predecessors, (1294), 58 states have call successors, (58), 21 states have call predecessors, (58), 21 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:54:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1410 transitions. [2025-03-08 16:54:33,331 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1410 transitions. Word has length 123 [2025-03-08 16:54:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1410 transitions. [2025-03-08 16:54:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1410 transitions. [2025-03-08 16:54:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:33,332 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:54:33,332 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -787112464, now seen corresponding path program 1 times [2025-03-08 16:54:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328786216] [2025-03-08 16:54:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:33,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:33,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:33,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:33,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328786216] [2025-03-08 16:54:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328786216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:54:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688389628] [2025-03-08 16:54:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:54:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:33,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:54:33,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:54:33,972 INFO L87 Difference]: Start difference. First operand 1122 states and 1410 transitions. Second operand has 11 states, 9 states have (on average 6.222222222222222) 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), 2 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:34,625 INFO L93 Difference]: Finished difference Result 1994 states and 2485 transitions. [2025-03-08 16:54:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:54:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.222222222222222) 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), 2 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2025-03-08 16:54:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:34,629 INFO L225 Difference]: With dead ends: 1994 [2025-03-08 16:54:34,629 INFO L226 Difference]: Without dead ends: 1357 [2025-03-08 16:54:34,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:54:34,630 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 236 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:34,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 777 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:54:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-08 16:54:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1271. [2025-03-08 16:54:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1173 states have (on average 1.2233589087809036) internal successors, (1435), 1178 states have internal predecessors, (1435), 70 states have call successors, (70), 27 states have call predecessors, (70), 27 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 16:54:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1575 transitions. [2025-03-08 16:54:34,723 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1575 transitions. Word has length 123 [2025-03-08 16:54:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:34,723 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1575 transitions. [2025-03-08 16:54:34,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.222222222222222) 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), 2 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 16:54:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1575 transitions. [2025-03-08 16:54:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:34,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:34,724 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:54:34,725 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:34,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1624258352, now seen corresponding path program 1 times [2025-03-08 16:54:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:34,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919399327] [2025-03-08 16:54:34,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:34,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:34,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:34,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:34,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:35,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-03-08 16:54:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919399327] [2025-03-08 16:54:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919399327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:35,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:54:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566872455] [2025-03-08 16:54:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:54:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:35,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:54:35,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:54:35,306 INFO L87 Difference]: Start difference. First operand 1271 states and 1575 transitions. Second operand has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:35,907 INFO L93 Difference]: Finished difference Result 2037 states and 2526 transitions. [2025-03-08 16:54:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:54:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-08 16:54:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:35,912 INFO L225 Difference]: With dead ends: 2037 [2025-03-08 16:54:35,912 INFO L226 Difference]: Without dead ends: 1377 [2025-03-08 16:54:35,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:54:35,913 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 238 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:35,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 677 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-08 16:54:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1176. [2025-03-08 16:54:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1084 states have (on average 1.216789667896679) internal successors, (1319), 1088 states have internal predecessors, (1319), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1451 transitions. [2025-03-08 16:54:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1451 transitions. Word has length 123 [2025-03-08 16:54:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1451 transitions. [2025-03-08 16:54:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1451 transitions. [2025-03-08 16:54:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:36,044 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:54:36,044 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 190152562, now seen corresponding path program 1 times [2025-03-08 16:54:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969093504] [2025-03-08 16:54:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:36,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:36,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:37,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969093504] [2025-03-08 16:54:37,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969093504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:37,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:37,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:54:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770691837] [2025-03-08 16:54:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:37,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:54:37,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:37,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:54:37,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:54:37,243 INFO L87 Difference]: Start difference. First operand 1176 states and 1451 transitions. Second operand has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:54:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:39,828 INFO L93 Difference]: Finished difference Result 2182 states and 2673 transitions. [2025-03-08 16:54:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:54:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) Word has length 123 [2025-03-08 16:54:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:39,832 INFO L225 Difference]: With dead ends: 2182 [2025-03-08 16:54:39,832 INFO L226 Difference]: Without dead ends: 1525 [2025-03-08 16:54:39,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:54:39,833 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 644 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:39,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 942 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 16:54:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-03-08 16:54:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1184. [2025-03-08 16:54:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1092 states have (on average 1.215201465201465) internal successors, (1327), 1096 states have internal predecessors, (1327), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1459 transitions. [2025-03-08 16:54:39,907 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1459 transitions. Word has length 123 [2025-03-08 16:54:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:39,908 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1459 transitions. [2025-03-08 16:54:39,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:54:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1459 transitions. [2025-03-08 16:54:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:39,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:39,908 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 16:54:39,909 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:39,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1898436236, now seen corresponding path program 1 times [2025-03-08 16:54:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673023562] [2025-03-08 16:54:39,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:39,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:39,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:39,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:39,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:41,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673023562] [2025-03-08 16:54:41,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673023562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:41,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:41,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:54:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997969507] [2025-03-08 16:54:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:41,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:54:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:41,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:54:41,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:54:41,006 INFO L87 Difference]: Start difference. First operand 1184 states and 1459 transitions. Second operand has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:54:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:43,244 INFO L93 Difference]: Finished difference Result 1870 states and 2316 transitions. [2025-03-08 16:54:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:54:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 123 [2025-03-08 16:54:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:43,249 INFO L225 Difference]: With dead ends: 1870 [2025-03-08 16:54:43,249 INFO L226 Difference]: Without dead ends: 1273 [2025-03-08 16:54:43,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:54:43,250 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 465 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:43,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 991 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 16:54:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-08 16:54:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1176. [2025-03-08 16:54:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1084 states have (on average 1.2149446494464944) internal successors, (1317), 1088 states have internal predecessors, (1317), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1449 transitions. [2025-03-08 16:54:43,335 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1449 transitions. Word has length 123 [2025-03-08 16:54:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:43,335 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1449 transitions. [2025-03-08 16:54:43,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 16:54:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1449 transitions. [2025-03-08 16:54:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:43,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:43,336 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:54:43,336 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1992796339, now seen corresponding path program 1 times [2025-03-08 16:54:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137590335] [2025-03-08 16:54:43,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:43,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:43,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137590335] [2025-03-08 16:54:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137590335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:43,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:54:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317470127] [2025-03-08 16:54:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:54:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:43,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:54:43,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:43,738 INFO L87 Difference]: Start difference. First operand 1176 states and 1449 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:44,219 INFO L93 Difference]: Finished difference Result 2241 states and 2789 transitions. [2025-03-08 16:54:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:54:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 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 123 [2025-03-08 16:54:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:44,223 INFO L225 Difference]: With dead ends: 2241 [2025-03-08 16:54:44,223 INFO L226 Difference]: Without dead ends: 1537 [2025-03-08 16:54:44,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:54:44,224 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 168 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:44,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 420 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2025-03-08 16:54:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1200. [2025-03-08 16:54:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1108 states have (on average 1.21028880866426) internal successors, (1341), 1112 states have internal predecessors, (1341), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1473 transitions. [2025-03-08 16:54:44,311 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1473 transitions. Word has length 123 [2025-03-08 16:54:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1473 transitions. [2025-03-08 16:54:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1473 transitions. [2025-03-08 16:54:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 16:54:44,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:44,312 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 16:54:44,312 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1609069260, now seen corresponding path program 1 times [2025-03-08 16:54:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:44,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477932465] [2025-03-08 16:54:44,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:44,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 16:54:44,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 16:54:44,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:44,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477932465] [2025-03-08 16:54:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477932465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:54:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005270961] [2025-03-08 16:54:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:44,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:54:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:54:44,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:54:44,948 INFO L87 Difference]: Start difference. First operand 1200 states and 1473 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:45,703 INFO L93 Difference]: Finished difference Result 1980 states and 2441 transitions. [2025-03-08 16:54:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:54:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-08 16:54:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:45,706 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 16:54:45,706 INFO L226 Difference]: Without dead ends: 1345 [2025-03-08 16:54:45,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:54:45,708 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 286 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:45,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 926 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:54:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-08 16:54:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1196. [2025-03-08 16:54:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1104 states have (on average 1.2056159420289856) internal successors, (1331), 1108 states have internal predecessors, (1331), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1463 transitions. [2025-03-08 16:54:45,792 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1463 transitions. Word has length 123 [2025-03-08 16:54:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1463 transitions. [2025-03-08 16:54:45,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 16:54:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1463 transitions. [2025-03-08 16:54:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:54:45,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:45,793 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-03-08 16:54:45,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 16:54:45,793 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:45,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1800982412, now seen corresponding path program 1 times [2025-03-08 16:54:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994453670] [2025-03-08 16:54:45,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:45,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:54:45,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:54:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994453670] [2025-03-08 16:54:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994453670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:46,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:54:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676596652] [2025-03-08 16:54:46,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:46,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:54:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:46,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:54:46,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:54:46,384 INFO L87 Difference]: Start difference. First operand 1196 states and 1463 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:46,958 INFO L93 Difference]: Finished difference Result 2117 states and 2623 transitions. [2025-03-08 16:54:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:54:46,958 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), 2 states have call successors, (14), 1 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 125 [2025-03-08 16:54:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:46,962 INFO L225 Difference]: With dead ends: 2117 [2025-03-08 16:54:46,962 INFO L226 Difference]: Without dead ends: 1528 [2025-03-08 16:54:46,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:54:46,963 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 73 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:46,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 981 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-08 16:54:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1274. [2025-03-08 16:54:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1182 states have (on average 1.215736040609137) internal successors, (1437), 1186 states have internal predecessors, (1437), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1569 transitions. [2025-03-08 16:54:47,061 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1569 transitions. Word has length 125 [2025-03-08 16:54:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1569 transitions. [2025-03-08 16:54:47,062 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1569 transitions. [2025-03-08 16:54:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:54:47,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:47,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 16:54:47,063 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:47,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash -986433075, now seen corresponding path program 1 times [2025-03-08 16:54:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237820301] [2025-03-08 16:54:47,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:54:47,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:54:47,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:47,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237820301] [2025-03-08 16:54:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237820301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:54:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687291163] [2025-03-08 16:54:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:47,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:47,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:47,208 INFO L87 Difference]: Start difference. First operand 1274 states and 1569 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-03-08 16:54:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:47,445 INFO L93 Difference]: Finished difference Result 2250 states and 2782 transitions. [2025-03-08 16:54:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:54:47,446 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-03-08 16:54:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:47,449 INFO L225 Difference]: With dead ends: 2250 [2025-03-08 16:54:47,449 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 16:54:47,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:47,450 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 49 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:47,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 418 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 16:54:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1268. [2025-03-08 16:54:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1176 states have (on average 1.2040816326530612) internal successors, (1416), 1180 states have internal predecessors, (1416), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1548 transitions. [2025-03-08 16:54:47,538 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1548 transitions. Word has length 125 [2025-03-08 16:54:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:47,538 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1548 transitions. [2025-03-08 16:54:47,538 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-03-08 16:54:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1548 transitions. [2025-03-08 16:54:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:54:47,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:47,539 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-03-08 16:54:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 16:54:47,539 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash -944723404, now seen corresponding path program 1 times [2025-03-08 16:54:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446079466] [2025-03-08 16:54:47,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:47,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:54:47,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:54:47,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:47,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446079466] [2025-03-08 16:54:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446079466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:54:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518013104] [2025-03-08 16:54:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:54:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:48,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:54:48,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:54:48,742 INFO L87 Difference]: Start difference. First operand 1268 states and 1548 transitions. Second operand has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:49,951 INFO L93 Difference]: Finished difference Result 1982 states and 2449 transitions. [2025-03-08 16:54:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 16:54:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:54:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:49,955 INFO L225 Difference]: With dead ends: 1982 [2025-03-08 16:54:49,955 INFO L226 Difference]: Without dead ends: 1315 [2025-03-08 16:54:49,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2025-03-08 16:54:49,956 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 256 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:49,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 863 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:54:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-03-08 16:54:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1250. [2025-03-08 16:54:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1158 states have (on average 1.2037996545768566) internal successors, (1394), 1162 states have internal predecessors, (1394), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1526 transitions. [2025-03-08 16:54:50,044 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1526 transitions. Word has length 125 [2025-03-08 16:54:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:50,044 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1526 transitions. [2025-03-08 16:54:50,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1526 transitions. [2025-03-08 16:54:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:54:50,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:50,045 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-03-08 16:54:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 16:54:50,045 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1955207629, now seen corresponding path program 1 times [2025-03-08 16:54:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885869314] [2025-03-08 16:54:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:54:50,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:54:50,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:50,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885869314] [2025-03-08 16:54:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885869314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973294480] [2025-03-08 16:54:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:50,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:50,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:50,317 INFO L87 Difference]: Start difference. First operand 1250 states and 1526 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:50,633 INFO L93 Difference]: Finished difference Result 2279 states and 2793 transitions. [2025-03-08 16:54:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 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 125 [2025-03-08 16:54:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:50,636 INFO L225 Difference]: With dead ends: 2279 [2025-03-08 16:54:50,636 INFO L226 Difference]: Without dead ends: 1562 [2025-03-08 16:54:50,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:50,637 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 426 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-03-08 16:54:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1230. [2025-03-08 16:54:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.20298769771529) internal successors, (1369), 1142 states have internal predecessors, (1369), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1501 transitions. [2025-03-08 16:54:50,726 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1501 transitions. Word has length 125 [2025-03-08 16:54:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:50,726 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1501 transitions. [2025-03-08 16:54:50,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1501 transitions. [2025-03-08 16:54:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 16:54:50,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:50,727 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-03-08 16:54:50,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 16:54:50,727 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1604407692, now seen corresponding path program 1 times [2025-03-08 16:54:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351597514] [2025-03-08 16:54:50,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:50,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 16:54:50,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 16:54:50,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:50,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351597514] [2025-03-08 16:54:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351597514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:52,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:52,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:54:52,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622316419] [2025-03-08 16:54:52,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:52,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:54:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:52,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:54:52,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:54:52,160 INFO L87 Difference]: Start difference. First operand 1230 states and 1501 transitions. Second operand has 14 states, 10 states have (on average 5.8) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:53,425 INFO L93 Difference]: Finished difference Result 1990 states and 2455 transitions. [2025-03-08 16:54:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:54:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 5.8) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-03-08 16:54:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:53,428 INFO L225 Difference]: With dead ends: 1990 [2025-03-08 16:54:53,428 INFO L226 Difference]: Without dead ends: 1329 [2025-03-08 16:54:53,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:54:53,429 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 173 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:53,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 942 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:54:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-08 16:54:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1230. [2025-03-08 16:54:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.2012302284710017) internal successors, (1367), 1142 states have internal predecessors, (1367), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1499 transitions. [2025-03-08 16:54:53,516 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1499 transitions. Word has length 125 [2025-03-08 16:54:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:53,516 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1499 transitions. [2025-03-08 16:54:53,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 5.8) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 16:54:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1499 transitions. [2025-03-08 16:54:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:54:53,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:53,518 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-03-08 16:54:53,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 16:54:53,518 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 633802575, now seen corresponding path program 1 times [2025-03-08 16:54:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253272158] [2025-03-08 16:54:53,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:53,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:54:53,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:54:53,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:53,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253272158] [2025-03-08 16:54:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253272158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:54:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823019077] [2025-03-08 16:54:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:53,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:53,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:53,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:53,635 INFO L87 Difference]: Start difference. First operand 1230 states and 1499 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-03-08 16:54:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:53,952 INFO L93 Difference]: Finished difference Result 2179 states and 2660 transitions. [2025-03-08 16:54:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:54:53,953 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-03-08 16:54:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:53,956 INFO L225 Difference]: With dead ends: 2179 [2025-03-08 16:54:53,956 INFO L226 Difference]: Without dead ends: 1462 [2025-03-08 16:54:53,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:53,957 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 72 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:53,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 421 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-03-08 16:54:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1135. [2025-03-08 16:54:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1043 states have (on average 1.1946308724832215) internal successors, (1246), 1047 states have internal predecessors, (1246), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 16:54:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1378 transitions. [2025-03-08 16:54:54,046 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1378 transitions. Word has length 127 [2025-03-08 16:54:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:54,046 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1378 transitions. [2025-03-08 16:54:54,046 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-03-08 16:54:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1378 transitions. [2025-03-08 16:54:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 16:54:54,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:54,047 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-03-08 16:54:54,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 16:54:54,047 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:54,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 925177682, now seen corresponding path program 1 times [2025-03-08 16:54:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462706253] [2025-03-08 16:54:54,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:54,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 16:54:54,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 16:54:54,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:54,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:54:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462706253] [2025-03-08 16:54:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462706253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 16:54:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248707512] [2025-03-08 16:54:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:54:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:54,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:54:54,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:54:54,985 INFO L87 Difference]: Start difference. First operand 1135 states and 1378 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:56,784 INFO L93 Difference]: Finished difference Result 2609 states and 3205 transitions. [2025-03-08 16:54:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 16:54:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (14), 1 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 127 [2025-03-08 16:54:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:56,788 INFO L225 Difference]: With dead ends: 2609 [2025-03-08 16:54:56,788 INFO L226 Difference]: Without dead ends: 1948 [2025-03-08 16:54:56,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 16:54:56,790 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 281 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:56,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1635 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:54:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-08 16:54:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1387. [2025-03-08 16:54:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1268 states have (on average 1.194794952681388) internal successors, (1515), 1273 states have internal predecessors, (1515), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:54:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1687 transitions. [2025-03-08 16:54:56,970 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1687 transitions. Word has length 127 [2025-03-08 16:54:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1687 transitions. [2025-03-08 16:54:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:54:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1687 transitions. [2025-03-08 16:54:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 16:54:56,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:56,972 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 16:54:56,973 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1213251115, now seen corresponding path program 1 times [2025-03-08 16:54:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696489358] [2025-03-08 16:54:56,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:56,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 16:54:57,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 16:54:57,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:57,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-03-08 16:54:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696489358] [2025-03-08 16:54:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696489358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456471289] [2025-03-08 16:54:58,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:58,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:54:58,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:54:58,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 16:54:58,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 16:54:58,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:58,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:58,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:54:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:58,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:54:58,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2025-03-08 16:54:58,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:58,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 52 [2025-03-08 16:54:58,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 52 [2025-03-08 16:54:58,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:58,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 74 [2025-03-08 16:54:58,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:58,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 26 [2025-03-08 16:54:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-08 16:54:58,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456471289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:58,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2025-03-08 16:54:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708495341] [2025-03-08 16:54:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:58,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:58,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:58,664 INFO L87 Difference]: Start difference. First operand 1387 states and 1687 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-03-08 16:54:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:59,006 INFO L93 Difference]: Finished difference Result 2390 states and 2921 transitions. [2025-03-08 16:54:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:59,006 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 232 [2025-03-08 16:54:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:59,009 INFO L225 Difference]: With dead ends: 2390 [2025-03-08 16:54:59,009 INFO L226 Difference]: Without dead ends: 1547 [2025-03-08 16:54:59,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:54:59,011 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 119 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:59,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 374 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:54:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-08 16:54:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1369. [2025-03-08 16:54:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1250 states have (on average 1.1736) internal successors, (1467), 1255 states have internal predecessors, (1467), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:54:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1639 transitions. [2025-03-08 16:54:59,127 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1639 transitions. Word has length 232 [2025-03-08 16:54:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:59,127 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1639 transitions. [2025-03-08 16:54:59,128 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-03-08 16:54:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1639 transitions. [2025-03-08 16:54:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 16:54:59,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:59,129 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:59,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:54:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:59,330 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:59,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 998726897, now seen corresponding path program 1 times [2025-03-08 16:54:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253083609] [2025-03-08 16:54:59,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:59,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 16:54:59,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 16:54:59,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:59,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 16:55:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:55:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253083609] [2025-03-08 16:55:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253083609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142837622] [2025-03-08 16:55:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:55:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:55:00,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:55:00,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:55:00,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 16:55:00,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 16:55:00,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:00,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:00,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:55:00,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:00,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:55:00,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2025-03-08 16:55:00,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:00,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 53 [2025-03-08 16:55:00,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:00,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 53 [2025-03-08 16:55:00,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:00,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 75 [2025-03-08 16:55:00,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:00,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 27 [2025-03-08 16:55:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-08 16:55:00,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142837622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:55:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2025-03-08 16:55:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994655565] [2025-03-08 16:55:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:55:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:55:00,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:55:00,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:55:00,929 INFO L87 Difference]: Start difference. First operand 1369 states and 1639 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-03-08 16:55:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:01,223 INFO L93 Difference]: Finished difference Result 1956 states and 2355 transitions. [2025-03-08 16:55:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:55:01,224 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 232 [2025-03-08 16:55:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:01,226 INFO L225 Difference]: With dead ends: 1956 [2025-03-08 16:55:01,226 INFO L226 Difference]: Without dead ends: 1416 [2025-03-08 16:55:01,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:55:01,227 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 77 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:01,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 355 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:55:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-08 16:55:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1360. [2025-03-08 16:55:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1241 states have (on average 1.1676067687348912) internal successors, (1449), 1246 states have internal predecessors, (1449), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:55:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1621 transitions. [2025-03-08 16:55:01,354 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1621 transitions. Word has length 232 [2025-03-08 16:55:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:01,354 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1621 transitions. [2025-03-08 16:55:01,354 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-03-08 16:55:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1621 transitions. [2025-03-08 16:55:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 16:55:01,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:01,356 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-03-08 16:55:01,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:55:01,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:55:01,557 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:01,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 392442592, now seen corresponding path program 1 times [2025-03-08 16:55:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115437975] [2025-03-08 16:55:01,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:01,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 16:55:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 16:55:01,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:01,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2025-03-08 16:55:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:55:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115437975] [2025-03-08 16:55:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115437975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:55:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752484659] [2025-03-08 16:55:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:55:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:55:02,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:55:02,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:55:02,039 INFO L87 Difference]: Start difference. First operand 1360 states and 1621 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-03-08 16:55:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:02,443 INFO L93 Difference]: Finished difference Result 2805 states and 3331 transitions. [2025-03-08 16:55:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:55:02,444 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-03-08 16:55:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:02,446 INFO L225 Difference]: With dead ends: 2805 [2025-03-08 16:55:02,446 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 16:55:02,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:55:02,448 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 142 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:02,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 232 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:55:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 16:55:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1483. [2025-03-08 16:55:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1364 states have (on average 1.1700879765395895) internal successors, (1596), 1369 states have internal predecessors, (1596), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:55:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1768 transitions. [2025-03-08 16:55:02,564 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1768 transitions. Word has length 233 [2025-03-08 16:55:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1768 transitions. [2025-03-08 16:55:02,565 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-03-08 16:55:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1768 transitions. [2025-03-08 16:55:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 16:55:02,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:02,567 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-03-08 16:55:02,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 16:55:02,567 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash -860808864, now seen corresponding path program 1 times [2025-03-08 16:55:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389421921] [2025-03-08 16:55:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:02,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 16:55:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 16:55:02,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:02,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-08 16:55:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:55:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389421921] [2025-03-08 16:55:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389421921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:55:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595334902] [2025-03-08 16:55:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:55:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:55:03,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:55:03,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:55:03,029 INFO L87 Difference]: Start difference. First operand 1483 states and 1768 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03-08 16:55:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:03,380 INFO L93 Difference]: Finished difference Result 2900 states and 3451 transitions. [2025-03-08 16:55:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:55:03,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03-08 16:55:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:03,384 INFO L225 Difference]: With dead ends: 2900 [2025-03-08 16:55:03,384 INFO L226 Difference]: Without dead ends: 1587 [2025-03-08 16:55:03,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:55:03,386 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:03,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 393 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:55:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-03-08 16:55:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1483. [2025-03-08 16:55:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1364 states have (on average 1.1656891495601174) internal successors, (1590), 1369 states have internal predecessors, (1590), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 16:55:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1762 transitions. [2025-03-08 16:55:03,521 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1762 transitions. Word has length 233 [2025-03-08 16:55:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:03,522 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1762 transitions. [2025-03-08 16:55:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03-08 16:55:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1762 transitions. [2025-03-08 16:55:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 16:55:03,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:03,524 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-03-08 16:55:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 16:55:03,525 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1637207073, now seen corresponding path program 1 times [2025-03-08 16:55:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:55:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393170025] [2025-03-08 16:55:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:55:03,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 16:55:03,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 16:55:03,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat