./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-56.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 ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:41:15,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:41:15,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:41:15,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:41:15,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:41:15,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:41:15,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:41:15,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:41:15,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:41:15,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:41:15,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:41:15,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:41:15,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:41:15,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:41:15,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:41:15,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:41:15,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:41:15,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:41:15,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:41:15,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:41:15,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:41:15,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:41:15,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:41:15,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:41:15,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:41:15,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:41:15,740 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 -> ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 [2025-03-04 01:41:15,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:41:15,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:41:15,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:41:15,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:41:15,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:41:15,987 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-56.i [2025-03-04 01:41:17,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488325b2b/717bdb7e96a840f9bfd77b7eed34bd89/FLAG3d18e052c [2025-03-04 01:41:17,411 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:41:17,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2025-03-04 01:41:17,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488325b2b/717bdb7e96a840f9bfd77b7eed34bd89/FLAG3d18e052c [2025-03-04 01:41:17,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488325b2b/717bdb7e96a840f9bfd77b7eed34bd89 [2025-03-04 01:41:17,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:41:17,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:41:17,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:41:17,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:41:17,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:41:17,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6bd2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17, skipping insertion in model container [2025-03-04 01:41:17,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:41:17,572 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-56.i[916,929] [2025-03-04 01:41:17,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:41:17,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:41:17,643 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-56.i[916,929] [2025-03-04 01:41:17,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:41:17,696 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:41:17,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17 WrapperNode [2025-03-04 01:41:17,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:41:17,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:41:17,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:41:17,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:41:17,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,758 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-03-04 01:41:17,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:41:17,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:41:17,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:41:17,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:41:17,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,778 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:41:17,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:41:17,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:41:17,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:41:17,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:41:17,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (1/1) ... [2025-03-04 01:41:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:41:17,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:41:17,844 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-04 01:41:17,847 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-04 01:41:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:41:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:41:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:41:17,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:41:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:41:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:41:17,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:41:17,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:41:17,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:41:18,510 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~mem90#1;havoc property_#t~bitwise91#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem98#1;havoc property_#t~mem97#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~ite106#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1;havoc property_#t~ite157#1;havoc property_#t~mem145#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~bitwise144#1;havoc property_#t~ite154#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~short158#1; [2025-03-04 01:41:18,544 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-04 01:41:18,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:41:18,561 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:41:18,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:41:18,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:41:18 BoogieIcfgContainer [2025-03-04 01:41:18,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:41:18,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:41:18,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:41:18,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:41:18,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:41:17" (1/3) ... [2025-03-04 01:41:18,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcba302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:41:18, skipping insertion in model container [2025-03-04 01:41:18,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:41:17" (2/3) ... [2025-03-04 01:41:18,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcba302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:41:18, skipping insertion in model container [2025-03-04 01:41:18,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:41:18" (3/3) ... [2025-03-04 01:41:18,572 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-56.i [2025-03-04 01:41:18,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:41:18,594 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:41:18,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:41:18,655 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;@736d6836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:41:18,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:41:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:41:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:41:18,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:18,683 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:18,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:18,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -807210912, now seen corresponding path program 1 times [2025-03-04 01:41:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34802784] [2025-03-04 01:41:18,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:18,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:41:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:41:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:18,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:41:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34802784] [2025-03-04 01:41:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34802784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:41:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463187902] [2025-03-04 01:41:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:19,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:41:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:41:19,010 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-04 01:41:19,011 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-04 01:41:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:41:19,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:41:19,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:19,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:19,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:41:19,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:41:19,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:41:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463187902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:19,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:41:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:41:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817954665] [2025-03-04 01:41:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:19,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:41:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:19,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:41:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:41:19,306 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:19,332 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-03-04 01:41:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:41:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-04 01:41:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:19,341 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:41:19,342 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:41:19,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-04 01:41:19,349 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:19,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:41:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:41:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:41:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:41:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-04 01:41:19,400 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-03-04 01:41:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-04 01:41:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-04 01:41:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:41:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:19,408 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:19,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:41:19,609 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-04 01:41:19,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1867327191, now seen corresponding path program 1 times [2025-03-04 01:41:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385933721] [2025-03-04 01:41:19,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:41:19,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:41:19,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:19,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385933721] [2025-03-04 01:41:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385933721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:41:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259903089] [2025-03-04 01:41:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:41:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:41:21,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:41:21,560 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:23,447 INFO L93 Difference]: Finished difference Result 663 states and 992 transitions. [2025-03-04 01:41:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:41:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:41:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:23,456 INFO L225 Difference]: With dead ends: 663 [2025-03-04 01:41:23,456 INFO L226 Difference]: Without dead ends: 544 [2025-03-04 01:41:23,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:41:23,458 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 653 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1539 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:41:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-04 01:41:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 287. [2025-03-04 01:41:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 246 states have (on average 1.4552845528455285) internal successors, (358), 246 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 434 transitions. [2025-03-04 01:41:23,510 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 434 transitions. Word has length 151 [2025-03-04 01:41:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 434 transitions. [2025-03-04 01:41:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 434 transitions. [2025-03-04 01:41:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:41:23,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:23,518 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:23,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:41:23,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1923212252, now seen corresponding path program 1 times [2025-03-04 01:41:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:23,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522577612] [2025-03-04 01:41:23,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:23,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:41:23,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:41:23,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:23,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522577612] [2025-03-04 01:41:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522577612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:41:23,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892535692] [2025-03-04 01:41:23,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:23,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:41:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:41:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:23,642 INFO L87 Difference]: Start difference. First operand 287 states and 434 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:23,715 INFO L93 Difference]: Finished difference Result 572 states and 867 transitions. [2025-03-04 01:41:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:41:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:41:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:23,717 INFO L225 Difference]: With dead ends: 572 [2025-03-04 01:41:23,717 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:41:23,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:23,718 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:23,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:41:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:41:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 01:41:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 247 states have (on average 1.4493927125506072) internal successors, (358), 247 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 434 transitions. [2025-03-04 01:41:23,741 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 434 transitions. Word has length 152 [2025-03-04 01:41:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:23,741 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 434 transitions. [2025-03-04 01:41:23,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 434 transitions. [2025-03-04 01:41:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:41:23,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:23,743 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:23,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:41:23,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:23,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1756499512, now seen corresponding path program 1 times [2025-03-04 01:41:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522777843] [2025-03-04 01:41:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:41:23,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:41:23,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522777843] [2025-03-04 01:41:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522777843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:41:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145517812] [2025-03-04 01:41:23,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:23,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:41:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:23,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:41:23,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:23,844 INFO L87 Difference]: Start difference. First operand 288 states and 434 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:23,920 INFO L93 Difference]: Finished difference Result 577 states and 873 transitions. [2025-03-04 01:41:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:41:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:41:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:23,922 INFO L225 Difference]: With dead ends: 577 [2025-03-04 01:41:23,922 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 01:41:23,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:23,923 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:23,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:41:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 01:41:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-04 01:41:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.4422310756972112) internal successors, (362), 251 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 438 transitions. [2025-03-04 01:41:23,949 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 438 transitions. Word has length 152 [2025-03-04 01:41:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 438 transitions. [2025-03-04 01:41:23,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 438 transitions. [2025-03-04 01:41:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:41:23,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:23,953 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:41:23,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:23,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1167816827, now seen corresponding path program 1 times [2025-03-04 01:41:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032169267] [2025-03-04 01:41:23,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:23,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:41:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:41:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:24,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032169267] [2025-03-04 01:41:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032169267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:24,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:41:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068143196] [2025-03-04 01:41:24,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:24,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:41:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:24,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:41:24,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:24,046 INFO L87 Difference]: Start difference. First operand 292 states and 438 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:24,119 INFO L93 Difference]: Finished difference Result 579 states and 869 transitions. [2025-03-04 01:41:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:41:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:41:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:24,121 INFO L225 Difference]: With dead ends: 579 [2025-03-04 01:41:24,123 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 01:41:24,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:24,124 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:24,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:41:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 01:41:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-04 01:41:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.429718875502008) internal successors, (356), 249 states have internal predecessors, (356), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 432 transitions. [2025-03-04 01:41:24,148 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 432 transitions. Word has length 152 [2025-03-04 01:41:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:24,149 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 432 transitions. [2025-03-04 01:41:24,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 432 transitions. [2025-03-04 01:41:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:24,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:24,151 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:24,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:41:24,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1343575892, now seen corresponding path program 1 times [2025-03-04 01:41:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852847171] [2025-03-04 01:41:24,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:24,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:24,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:24,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:41:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:24,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852847171] [2025-03-04 01:41:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852847171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:41:24,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780163915] [2025-03-04 01:41:24,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:41:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:41:24,348 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-04 01:41:24,350 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-04 01:41:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:24,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:24,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:24,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:24,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:41:24,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:24,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:41:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780163915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:41:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:41:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795619026] [2025-03-04 01:41:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:24,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:24,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:24,553 INFO L87 Difference]: Start difference. First operand 290 states and 432 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:24,590 INFO L93 Difference]: Finished difference Result 583 states and 869 transitions. [2025-03-04 01:41:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:41:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:24,594 INFO L225 Difference]: With dead ends: 583 [2025-03-04 01:41:24,594 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 01:41:24,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 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-04 01:41:24,595 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:24,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:41:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 01:41:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 01:41:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 255 states have (on average 1.419607843137255) internal successors, (362), 255 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 438 transitions. [2025-03-04 01:41:24,618 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 438 transitions. Word has length 153 [2025-03-04 01:41:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 438 transitions. [2025-03-04 01:41:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 438 transitions. [2025-03-04 01:41:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:24,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:24,622 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:24,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:41:24,822 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,SelfDestructingSolverStorable5 [2025-03-04 01:41:24,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1463848332, now seen corresponding path program 1 times [2025-03-04 01:41:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775338684] [2025-03-04 01:41:24,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:24,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:24,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:24,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775338684] [2025-03-04 01:41:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775338684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:41:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858642550] [2025-03-04 01:41:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:41:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:26,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:41:26,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:41:26,992 INFO L87 Difference]: Start difference. First operand 296 states and 438 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:41:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:28,093 INFO L93 Difference]: Finished difference Result 745 states and 1108 transitions. [2025-03-04 01:41:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:41:28,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-04 01:41:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:28,097 INFO L225 Difference]: With dead ends: 745 [2025-03-04 01:41:28,097 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 01:41:28,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:41:28,098 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:28,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 918 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:41:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 01:41:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 361. [2025-03-04 01:41:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 320 states have (on average 1.459375) internal successors, (467), 320 states have internal predecessors, (467), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:41:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 543 transitions. [2025-03-04 01:41:28,118 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 543 transitions. Word has length 153 [2025-03-04 01:41:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 543 transitions. [2025-03-04 01:41:28,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:41:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 543 transitions. [2025-03-04 01:41:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:28,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:28,120 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:41:28,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:28,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash 43703477, now seen corresponding path program 1 times [2025-03-04 01:41:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072159665] [2025-03-04 01:41:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:28,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:28,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:28,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072159665] [2025-03-04 01:41:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072159665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:41:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690435832] [2025-03-04 01:41:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:28,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:28,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:41:28,388 INFO L87 Difference]: Start difference. First operand 361 states and 543 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:28,713 INFO L93 Difference]: Finished difference Result 827 states and 1230 transitions. [2025-03-04 01:41:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:28,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:41:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:28,716 INFO L225 Difference]: With dead ends: 827 [2025-03-04 01:41:28,717 INFO L226 Difference]: Without dead ends: 469 [2025-03-04 01:41:28,718 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-04 01:41:28,718 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:28,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 569 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:41:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-04 01:41:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2025-03-04 01:41:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 414 states have (on average 1.432367149758454) internal successors, (593), 416 states have internal predecessors, (593), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 685 transitions. [2025-03-04 01:41:28,747 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 685 transitions. Word has length 153 [2025-03-04 01:41:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:28,748 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 685 transitions. [2025-03-04 01:41:28,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 685 transitions. [2025-03-04 01:41:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:28,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:28,753 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:41:28,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -249699530, now seen corresponding path program 1 times [2025-03-04 01:41:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141627265] [2025-03-04 01:41:28,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:28,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:28,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:28,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:28,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141627265] [2025-03-04 01:41:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141627265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:30,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:41:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973400372] [2025-03-04 01:41:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:30,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:41:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:41:30,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:41:30,267 INFO L87 Difference]: Start difference. First operand 465 states and 685 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:31,882 INFO L93 Difference]: Finished difference Result 1316 states and 1921 transitions. [2025-03-04 01:41:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:41:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:41:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:31,889 INFO L225 Difference]: With dead ends: 1316 [2025-03-04 01:41:31,890 INFO L226 Difference]: Without dead ends: 854 [2025-03-04 01:41:31,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:41:31,893 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 809 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:31,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1119 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:41:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-04 01:41:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 469. [2025-03-04 01:41:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 418 states have (on average 1.4282296650717703) internal successors, (597), 420 states have internal predecessors, (597), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 689 transitions. [2025-03-04 01:41:31,927 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 689 transitions. Word has length 153 [2025-03-04 01:41:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 689 transitions. [2025-03-04 01:41:31,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 689 transitions. [2025-03-04 01:41:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:31,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:31,932 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:41:31,932 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2126667337, now seen corresponding path program 1 times [2025-03-04 01:41:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284497400] [2025-03-04 01:41:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:31,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:31,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:31,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:32,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:32,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284497400] [2025-03-04 01:41:32,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284497400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:32,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:32,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:41:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965813949] [2025-03-04 01:41:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:32,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:32,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:41:32,167 INFO L87 Difference]: Start difference. First operand 469 states and 689 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:32,468 INFO L93 Difference]: Finished difference Result 1103 states and 1621 transitions. [2025-03-04 01:41:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:41:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:32,471 INFO L225 Difference]: With dead ends: 1103 [2025-03-04 01:41:32,471 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 01:41:32,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-04 01:41:32,474 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 74 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:32,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 424 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:41:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 01:41:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 487. [2025-03-04 01:41:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 436 states have (on average 1.4288990825688073) internal successors, (623), 438 states have internal predecessors, (623), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 715 transitions. [2025-03-04 01:41:32,498 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 715 transitions. Word has length 153 [2025-03-04 01:41:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:32,498 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 715 transitions. [2025-03-04 01:41:32,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 715 transitions. [2025-03-04 01:41:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:32,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:32,501 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:32,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:41:32,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:32,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1504888038, now seen corresponding path program 1 times [2025-03-04 01:41:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756934118] [2025-03-04 01:41:32,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:32,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:32,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:32,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:32,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756934118] [2025-03-04 01:41:34,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756934118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:34,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:41:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688311886] [2025-03-04 01:41:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:34,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:41:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:34,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:41:34,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:41:34,028 INFO L87 Difference]: Start difference. First operand 487 states and 715 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:35,122 INFO L93 Difference]: Finished difference Result 1163 states and 1704 transitions. [2025-03-04 01:41:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:41:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:41:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:35,127 INFO L225 Difference]: With dead ends: 1163 [2025-03-04 01:41:35,127 INFO L226 Difference]: Without dead ends: 679 [2025-03-04 01:41:35,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 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-04 01:41:35,129 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 68 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:35,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1101 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:41:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-04 01:41:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 531. [2025-03-04 01:41:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 480 states have (on average 1.4395833333333334) internal successors, (691), 482 states have internal predecessors, (691), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 783 transitions. [2025-03-04 01:41:35,157 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 783 transitions. Word has length 153 [2025-03-04 01:41:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:35,157 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 783 transitions. [2025-03-04 01:41:35,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 783 transitions. [2025-03-04 01:41:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:35,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:35,160 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:35,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:41:35,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:35,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1798291045, now seen corresponding path program 1 times [2025-03-04 01:41:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283747592] [2025-03-04 01:41:35,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:35,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:35,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:35,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:35,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283747592] [2025-03-04 01:41:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283747592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:41:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407631534] [2025-03-04 01:41:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:41:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:36,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:41:36,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:41:36,238 INFO L87 Difference]: Start difference. First operand 531 states and 783 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:36,854 INFO L93 Difference]: Finished difference Result 1205 states and 1760 transitions. [2025-03-04 01:41:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:41:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:41:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:36,858 INFO L225 Difference]: With dead ends: 1205 [2025-03-04 01:41:36,858 INFO L226 Difference]: Without dead ends: 677 [2025-03-04 01:41:36,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:36,860 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 82 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:36,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 682 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:41:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-04 01:41:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 533. [2025-03-04 01:41:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 482 states have (on average 1.4356846473029046) internal successors, (692), 484 states have internal predecessors, (692), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 784 transitions. [2025-03-04 01:41:36,883 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 784 transitions. Word has length 153 [2025-03-04 01:41:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:36,883 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 784 transitions. [2025-03-04 01:41:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 784 transitions. [2025-03-04 01:41:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:36,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:36,886 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:41:36,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:36,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1718584877, now seen corresponding path program 1 times [2025-03-04 01:41:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463828729] [2025-03-04 01:41:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:36,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:36,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:36,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:36,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463828729] [2025-03-04 01:41:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463828729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:41:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351959747] [2025-03-04 01:41:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:40,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:41:40,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:40,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:41:40,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:41:40,112 INFO L87 Difference]: Start difference. First operand 533 states and 784 transitions. Second operand has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:42,119 INFO L93 Difference]: Finished difference Result 1432 states and 2085 transitions. [2025-03-04 01:41:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:41:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:41:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:42,123 INFO L225 Difference]: With dead ends: 1432 [2025-03-04 01:41:42,123 INFO L226 Difference]: Without dead ends: 902 [2025-03-04 01:41:42,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:41:42,126 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 622 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:42,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1517 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:41:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-04 01:41:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 525. [2025-03-04 01:41:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 474 states have (on average 1.4345991561181435) internal successors, (680), 476 states have internal predecessors, (680), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2025-03-04 01:41:42,145 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 153 [2025-03-04 01:41:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:42,145 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2025-03-04 01:41:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.1) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2025-03-04 01:41:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:42,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:42,147 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:41:42,147 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -504436075, now seen corresponding path program 1 times [2025-03-04 01:41:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589807482] [2025-03-04 01:41:42,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:42,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:42,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:42,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:43,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589807482] [2025-03-04 01:41:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589807482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:43,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:43,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:41:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154701960] [2025-03-04 01:41:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:43,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:41:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:43,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:41:43,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:41:43,354 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:44,250 INFO L93 Difference]: Finished difference Result 1177 states and 1725 transitions. [2025-03-04 01:41:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:41:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:41:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:44,252 INFO L225 Difference]: With dead ends: 1177 [2025-03-04 01:41:44,253 INFO L226 Difference]: Without dead ends: 655 [2025-03-04 01:41:44,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 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-04 01:41:44,254 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 69 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:44,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1130 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:41:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-04 01:41:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 542. [2025-03-04 01:41:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 491 states have (on average 1.4378818737270875) internal successors, (706), 493 states have internal predecessors, (706), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 798 transitions. [2025-03-04 01:41:44,290 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 798 transitions. Word has length 153 [2025-03-04 01:41:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:44,290 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 798 transitions. [2025-03-04 01:41:44,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 798 transitions. [2025-03-04 01:41:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:44,291 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:41:44,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1759624583, now seen corresponding path program 1 times [2025-03-04 01:41:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713662663] [2025-03-04 01:41:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713662663] [2025-03-04 01:41:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713662663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:41:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811733466] [2025-03-04 01:41:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:41:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:44,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:41:44,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:41:44,981 INFO L87 Difference]: Start difference. First operand 542 states and 798 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:45,454 INFO L93 Difference]: Finished difference Result 1290 states and 1877 transitions. [2025-03-04 01:41:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:41:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:41:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:45,457 INFO L225 Difference]: With dead ends: 1290 [2025-03-04 01:41:45,458 INFO L226 Difference]: Without dead ends: 751 [2025-03-04 01:41:45,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-04 01:41:45,459 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 90 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:45,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 719 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:41:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-04 01:41:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 548. [2025-03-04 01:41:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 497 states have (on average 1.4366197183098592) internal successors, (714), 499 states have internal predecessors, (714), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 806 transitions. [2025-03-04 01:41:45,477 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 806 transitions. Word has length 153 [2025-03-04 01:41:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 806 transitions. [2025-03-04 01:41:45,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 806 transitions. [2025-03-04 01:41:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:45,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:45,478 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:45,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:41:45,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:45,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1728604776, now seen corresponding path program 1 times [2025-03-04 01:41:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685798224] [2025-03-04 01:41:45,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:45,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685798224] [2025-03-04 01:41:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685798224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:41:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818826119] [2025-03-04 01:41:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:46,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:41:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:46,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:41:46,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:41:46,813 INFO L87 Difference]: Start difference. First operand 548 states and 806 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:48,289 INFO L93 Difference]: Finished difference Result 1386 states and 2022 transitions. [2025-03-04 01:41:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:41:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:41:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:48,293 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 01:41:48,293 INFO L226 Difference]: Without dead ends: 841 [2025-03-04 01:41:48,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:41:48,295 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 586 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:48,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1356 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:41:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-04 01:41:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 563. [2025-03-04 01:41:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 512 states have (on average 1.44140625) internal successors, (738), 514 states have internal predecessors, (738), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 830 transitions. [2025-03-04 01:41:48,315 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 830 transitions. Word has length 153 [2025-03-04 01:41:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:48,315 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 830 transitions. [2025-03-04 01:41:48,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 830 transitions. [2025-03-04 01:41:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:48,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:48,317 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:41:48,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2022007783, now seen corresponding path program 1 times [2025-03-04 01:41:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545199072] [2025-03-04 01:41:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:48,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:48,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:48,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545199072] [2025-03-04 01:41:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545199072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:41:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638717860] [2025-03-04 01:41:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:41:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:50,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:41:50,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:41:50,074 INFO L87 Difference]: Start difference. First operand 563 states and 830 transitions. Second operand has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:52,352 INFO L93 Difference]: Finished difference Result 1393 states and 2036 transitions. [2025-03-04 01:41:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:41:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:41:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:52,357 INFO L225 Difference]: With dead ends: 1393 [2025-03-04 01:41:52,358 INFO L226 Difference]: Without dead ends: 833 [2025-03-04 01:41:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:41:52,360 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 563 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:52,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2114 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:41:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-04 01:41:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 565. [2025-03-04 01:41:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 514 states have (on average 1.4396887159533074) internal successors, (740), 516 states have internal predecessors, (740), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 832 transitions. [2025-03-04 01:41:52,387 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 832 transitions. Word has length 153 [2025-03-04 01:41:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:52,388 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 832 transitions. [2025-03-04 01:41:52,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.545454545454546) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:41:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2025-03-04 01:41:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:41:52,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:52,390 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:52,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:41:52,391 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:52,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1713227448, now seen corresponding path program 1 times [2025-03-04 01:41:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800986848] [2025-03-04 01:41:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:52,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:41:52,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:41:52,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:52,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800986848] [2025-03-04 01:41:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800986848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:41:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015686851] [2025-03-04 01:41:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:52,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:52,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:41:52,656 INFO L87 Difference]: Start difference. First operand 565 states and 832 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:52,980 INFO L93 Difference]: Finished difference Result 1198 states and 1760 transitions. [2025-03-04 01:41:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:41:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:52,983 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 01:41:52,983 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 01:41:52,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-04 01:41:52,985 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 77 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:52,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 540 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:41:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 01:41:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 563. [2025-03-04 01:41:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 512 states have (on average 1.4375) internal successors, (736), 514 states have internal predecessors, (736), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 828 transitions. [2025-03-04 01:41:53,001 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 828 transitions. Word has length 153 [2025-03-04 01:41:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 828 transitions. [2025-03-04 01:41:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 828 transitions. [2025-03-04 01:41:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:41:53,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:53,002 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:53,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:41:53,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:53,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1373803291, now seen corresponding path program 1 times [2025-03-04 01:41:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937142628] [2025-03-04 01:41:53,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:53,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:41:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:41:53,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937142628] [2025-03-04 01:41:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937142628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:41:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805763949] [2025-03-04 01:41:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:41:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:41:53,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:53,056 INFO L87 Difference]: Start difference. First operand 563 states and 828 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:53,108 INFO L93 Difference]: Finished difference Result 1112 states and 1635 transitions. [2025-03-04 01:41:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:41:53,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-04 01:41:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:53,111 INFO L225 Difference]: With dead ends: 1112 [2025-03-04 01:41:53,111 INFO L226 Difference]: Without dead ends: 552 [2025-03-04 01:41:53,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:53,112 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:53,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:41:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-04 01:41:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-04 01:41:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 501 states have (on average 1.4291417165668663) internal successors, (716), 503 states have internal predecessors, (716), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2025-03-04 01:41:53,127 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 154 [2025-03-04 01:41:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:53,127 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2025-03-04 01:41:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:41:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2025-03-04 01:41:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:41:53,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:53,128 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:41:53,128 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash 620818986, now seen corresponding path program 1 times [2025-03-04 01:41:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698792180] [2025-03-04 01:41:53,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:53,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:41:53,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:41:53,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:53,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698792180] [2025-03-04 01:41:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698792180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:41:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296750322] [2025-03-04 01:41:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:41:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:53,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:41:53,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:53,844 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:54,238 INFO L93 Difference]: Finished difference Result 1300 states and 1903 transitions. [2025-03-04 01:41:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:41:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:41:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:54,241 INFO L225 Difference]: With dead ends: 1300 [2025-03-04 01:41:54,242 INFO L226 Difference]: Without dead ends: 751 [2025-03-04 01:41:54,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:41:54,245 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:54,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 867 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:41:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-04 01:41:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 671. [2025-03-04 01:41:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 620 states have (on average 1.4419354838709677) internal successors, (894), 622 states have internal predecessors, (894), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:41:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 986 transitions. [2025-03-04 01:41:54,267 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 986 transitions. Word has length 155 [2025-03-04 01:41:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:54,267 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 986 transitions. [2025-03-04 01:41:54,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:41:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 986 transitions. [2025-03-04 01:41:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:41:54,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:54,269 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:41:54,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:54,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 651838793, now seen corresponding path program 1 times [2025-03-04 01:41:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609700695] [2025-03-04 01:41:54,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:41:54,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:41:54,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:54,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:41:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609700695] [2025-03-04 01:41:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609700695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:41:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548751821] [2025-03-04 01:41:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:41:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:55,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:41:55,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:41:55,835 INFO L87 Difference]: Start difference. First operand 671 states and 986 transitions. Second operand has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:59,244 INFO L93 Difference]: Finished difference Result 1575 states and 2282 transitions. [2025-03-04 01:41:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:41:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:41:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:59,248 INFO L225 Difference]: With dead ends: 1575 [2025-03-04 01:41:59,248 INFO L226 Difference]: Without dead ends: 907 [2025-03-04 01:41:59,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:41:59,250 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 707 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 3066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:59,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1875 Invalid, 3066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:41:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-04 01:41:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 727. [2025-03-04 01:41:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 668 states have (on average 1.4281437125748504) internal successors, (954), 671 states have internal predecessors, (954), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:41:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1058 transitions. [2025-03-04 01:41:59,285 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1058 transitions. Word has length 155 [2025-03-04 01:41:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1058 transitions. [2025-03-04 01:41:59,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.9375) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:41:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1058 transitions. [2025-03-04 01:41:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:41:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:59,288 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:41:59,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:59,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 537625079, now seen corresponding path program 1 times [2025-03-04 01:41:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258937077] [2025-03-04 01:41:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:59,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:41:59,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:41:59,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:59,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258937077] [2025-03-04 01:42:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258937077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-04 01:42:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509751109] [2025-03-04 01:42:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:42:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:01,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:42:01,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:42:01,914 INFO L87 Difference]: Start difference. First operand 727 states and 1058 transitions. Second operand has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:42:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:05,600 INFO L93 Difference]: Finished difference Result 1702 states and 2459 transitions. [2025-03-04 01:42:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 01:42:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-04 01:42:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:05,606 INFO L225 Difference]: With dead ends: 1702 [2025-03-04 01:42:05,606 INFO L226 Difference]: Without dead ends: 978 [2025-03-04 01:42:05,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=2113, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 01:42:05,609 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 469 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:05,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2948 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 01:42:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-04 01:42:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 817. [2025-03-04 01:42:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 755 states have (on average 1.4251655629139073) internal successors, (1076), 759 states have internal predecessors, (1076), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:42:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1184 transitions. [2025-03-04 01:42:05,635 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1184 transitions. Word has length 155 [2025-03-04 01:42:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:05,636 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1184 transitions. [2025-03-04 01:42:05,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:42:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1184 transitions. [2025-03-04 01:42:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:05,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:05,638 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:05,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:42:05,638 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash 244222072, now seen corresponding path program 1 times [2025-03-04 01:42:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32475977] [2025-03-04 01:42:05,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:05,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:05,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32475977] [2025-03-04 01:42:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32475977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:42:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315291064] [2025-03-04 01:42:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:05,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:42:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:05,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:42:05,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:42:05,820 INFO L87 Difference]: Start difference. First operand 817 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:06,039 INFO L93 Difference]: Finished difference Result 1752 states and 2525 transitions. [2025-03-04 01:42:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:42:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:42:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:06,042 INFO L225 Difference]: With dead ends: 1752 [2025-03-04 01:42:06,042 INFO L226 Difference]: Without dead ends: 938 [2025-03-04 01:42:06,043 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-04 01:42:06,044 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:06,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 470 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:42:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-04 01:42:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 813. [2025-03-04 01:42:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 751 states have (on average 1.4194407456724367) internal successors, (1066), 755 states have internal predecessors, (1066), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:42:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1174 transitions. [2025-03-04 01:42:06,069 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1174 transitions. Word has length 155 [2025-03-04 01:42:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:06,069 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1174 transitions. [2025-03-04 01:42:06,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1174 transitions. [2025-03-04 01:42:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:06,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:06,071 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:42:06,071 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:06,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash 282888534, now seen corresponding path program 1 times [2025-03-04 01:42:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:06,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323532038] [2025-03-04 01:42:06,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:06,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:06,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:06,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323532038] [2025-03-04 01:42:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323532038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:42:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796659436] [2025-03-04 01:42:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:06,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:42:06,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:06,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:42:06,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:42:06,217 INFO L87 Difference]: Start difference. First operand 813 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:06,465 INFO L93 Difference]: Finished difference Result 1690 states and 2426 transitions. [2025-03-04 01:42:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:42:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:42:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:06,469 INFO L225 Difference]: With dead ends: 1690 [2025-03-04 01:42:06,469 INFO L226 Difference]: Without dead ends: 880 [2025-03-04 01:42:06,470 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-04 01:42:06,470 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:06,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 459 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:42:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-04 01:42:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 801. [2025-03-04 01:42:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 736 states have (on average 1.4116847826086956) internal successors, (1039), 740 states have internal predecessors, (1039), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:42:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1151 transitions. [2025-03-04 01:42:06,495 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1151 transitions. Word has length 155 [2025-03-04 01:42:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:06,495 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1151 transitions. [2025-03-04 01:42:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1151 transitions. [2025-03-04 01:42:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:06,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:06,496 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:06,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:42:06,497 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2016464617, now seen corresponding path program 1 times [2025-03-04 01:42:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429505092] [2025-03-04 01:42:06,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:06,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:06,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:07,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:07,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429505092] [2025-03-04 01:42:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429505092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:07,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:07,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:42:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92019777] [2025-03-04 01:42:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:42:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:07,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:42:07,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:42:07,364 INFO L87 Difference]: Start difference. First operand 801 states and 1151 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:08,242 INFO L93 Difference]: Finished difference Result 1662 states and 2375 transitions. [2025-03-04 01:42:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:42:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:08,246 INFO L225 Difference]: With dead ends: 1662 [2025-03-04 01:42:08,246 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 01:42:08,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:42:08,247 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 88 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:08,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1200 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:42:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 01:42:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 839. [2025-03-04 01:42:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 765 states have (on average 1.3986928104575163) internal successors, (1070), 770 states have internal predecessors, (1070), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:42:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1194 transitions. [2025-03-04 01:42:08,301 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1194 transitions. Word has length 155 [2025-03-04 01:42:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:08,301 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1194 transitions. [2025-03-04 01:42:08,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1194 transitions. [2025-03-04 01:42:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:08,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:08,304 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:42:08,304 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:08,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 294204661, now seen corresponding path program 1 times [2025-03-04 01:42:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74586924] [2025-03-04 01:42:08,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:08,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74586924] [2025-03-04 01:42:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74586924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:42:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234634418] [2025-03-04 01:42:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:09,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:42:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:09,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:42:09,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:42:09,862 INFO L87 Difference]: Start difference. First operand 839 states and 1194 transitions. Second operand has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:42:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:11,839 INFO L93 Difference]: Finished difference Result 1813 states and 2569 transitions. [2025-03-04 01:42:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:42:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-04 01:42:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:11,843 INFO L225 Difference]: With dead ends: 1813 [2025-03-04 01:42:11,843 INFO L226 Difference]: Without dead ends: 977 [2025-03-04 01:42:11,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:42:11,844 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 526 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:11,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1769 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:42:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-04 01:42:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 837. [2025-03-04 01:42:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 763 states have (on average 1.3971166448230667) internal successors, (1066), 768 states have internal predecessors, (1066), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:42:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1190 transitions. [2025-03-04 01:42:11,874 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1190 transitions. Word has length 155 [2025-03-04 01:42:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1190 transitions. [2025-03-04 01:42:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:42:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1190 transitions. [2025-03-04 01:42:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:11,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:11,876 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:42:11,876 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1508353463, now seen corresponding path program 1 times [2025-03-04 01:42:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679011149] [2025-03-04 01:42:11,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:11,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:11,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:11,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:11,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679011149] [2025-03-04 01:42:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679011149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:42:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085757990] [2025-03-04 01:42:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:42:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:13,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:42:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:42:13,544 INFO L87 Difference]: Start difference. First operand 837 states and 1190 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:15,247 INFO L93 Difference]: Finished difference Result 1816 states and 2567 transitions. [2025-03-04 01:42:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:42:15,247 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:15,250 INFO L225 Difference]: With dead ends: 1816 [2025-03-04 01:42:15,250 INFO L226 Difference]: Without dead ends: 982 [2025-03-04 01:42:15,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:42:15,252 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 84 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:15,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2225 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:42:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-04 01:42:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 977. [2025-03-04 01:42:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 894 states have (on average 1.383668903803132) internal successors, (1237), 902 states have internal predecessors, (1237), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 60 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:42:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1373 transitions. [2025-03-04 01:42:15,290 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1373 transitions. Word has length 155 [2025-03-04 01:42:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:15,290 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1373 transitions. [2025-03-04 01:42:15,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1373 transitions. [2025-03-04 01:42:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:15,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:15,291 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:15,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:42:15,291 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:15,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash 65702378, now seen corresponding path program 1 times [2025-03-04 01:42:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086878531] [2025-03-04 01:42:15,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:15,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:15,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:15,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:15,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086878531] [2025-03-04 01:42:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086878531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:42:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648619027] [2025-03-04 01:42:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:16,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:42:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:42:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:42:16,219 INFO L87 Difference]: Start difference. First operand 977 states and 1373 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:17,334 INFO L93 Difference]: Finished difference Result 2184 states and 3067 transitions. [2025-03-04 01:42:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:42:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:17,338 INFO L225 Difference]: With dead ends: 2184 [2025-03-04 01:42:17,338 INFO L226 Difference]: Without dead ends: 1210 [2025-03-04 01:42:17,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:42:17,339 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 88 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:17,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1910 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:42:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-04 01:42:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1057. [2025-03-04 01:42:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 974 states have (on average 1.393223819301848) internal successors, (1357), 982 states have internal predecessors, (1357), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 60 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:42:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1493 transitions. [2025-03-04 01:42:17,380 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1493 transitions. Word has length 155 [2025-03-04 01:42:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:17,380 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1493 transitions. [2025-03-04 01:42:17,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1493 transitions. [2025-03-04 01:42:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:17,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:17,381 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:17,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:42:17,381 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 194785097, now seen corresponding path program 1 times [2025-03-04 01:42:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682680562] [2025-03-04 01:42:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682680562] [2025-03-04 01:42:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682680562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:18,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:42:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294652075] [2025-03-04 01:42:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:42:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:18,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:42:18,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:42:18,054 INFO L87 Difference]: Start difference. First operand 1057 states and 1493 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:18,660 INFO L93 Difference]: Finished difference Result 2429 states and 3420 transitions. [2025-03-04 01:42:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:42:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:18,664 INFO L225 Difference]: With dead ends: 2429 [2025-03-04 01:42:18,664 INFO L226 Difference]: Without dead ends: 1375 [2025-03-04 01:42:18,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:18,666 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 79 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:18,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 858 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:42:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-04 01:42:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1177. [2025-03-04 01:42:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1086 states have (on average 1.3904235727440146) internal successors, (1510), 1095 states have internal predecessors, (1510), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1658 transitions. [2025-03-04 01:42:18,712 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1658 transitions. Word has length 155 [2025-03-04 01:42:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:18,712 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1658 transitions. [2025-03-04 01:42:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1658 transitions. [2025-03-04 01:42:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:18,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:18,713 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:42:18,713 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:18,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash -439856247, now seen corresponding path program 1 times [2025-03-04 01:42:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995311795] [2025-03-04 01:42:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:18,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:18,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:19,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:19,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995311795] [2025-03-04 01:42:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995311795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:42:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113981896] [2025-03-04 01:42:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:42:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:19,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:42:19,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:42:19,440 INFO L87 Difference]: Start difference. First operand 1177 states and 1658 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:19,830 INFO L93 Difference]: Finished difference Result 2617 states and 3689 transitions. [2025-03-04 01:42:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:42:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:42:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:19,838 INFO L225 Difference]: With dead ends: 2617 [2025-03-04 01:42:19,838 INFO L226 Difference]: Without dead ends: 1443 [2025-03-04 01:42:19,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-04 01:42:19,840 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 64 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:19,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 705 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:42:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-04 01:42:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1226. [2025-03-04 01:42:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1135 states have (on average 1.3955947136563878) internal successors, (1584), 1144 states have internal predecessors, (1584), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1732 transitions. [2025-03-04 01:42:19,891 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1732 transitions. Word has length 155 [2025-03-04 01:42:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1732 transitions. [2025-03-04 01:42:19,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1732 transitions. [2025-03-04 01:42:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:19,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:19,893 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:19,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:42:19,893 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:19,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1027316395, now seen corresponding path program 1 times [2025-03-04 01:42:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995820485] [2025-03-04 01:42:19,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:19,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:19,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:19,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:19,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995820485] [2025-03-04 01:42:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995820485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:20,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:42:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172055168] [2025-03-04 01:42:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:20,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:42:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:20,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:42:20,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:42:20,564 INFO L87 Difference]: Start difference. First operand 1226 states and 1732 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:21,067 INFO L93 Difference]: Finished difference Result 2630 states and 3699 transitions. [2025-03-04 01:42:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:42:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:21,071 INFO L225 Difference]: With dead ends: 2630 [2025-03-04 01:42:21,071 INFO L226 Difference]: Without dead ends: 1407 [2025-03-04 01:42:21,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:42:21,072 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 81 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:21,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 784 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:42:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-04 01:42:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1225. [2025-03-04 01:42:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1134 states have (on average 1.3932980599647267) internal successors, (1580), 1143 states have internal predecessors, (1580), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1728 transitions. [2025-03-04 01:42:21,119 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1728 transitions. Word has length 155 [2025-03-04 01:42:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:21,119 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1728 transitions. [2025-03-04 01:42:21,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1728 transitions. [2025-03-04 01:42:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:21,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:21,120 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:21,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:42:21,120 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:21,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1156399114, now seen corresponding path program 1 times [2025-03-04 01:42:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170026452] [2025-03-04 01:42:21,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:21,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:21,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:21,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170026452] [2025-03-04 01:42:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170026452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:42:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297307379] [2025-03-04 01:42:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:22,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:42:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:22,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:42:22,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:42:22,051 INFO L87 Difference]: Start difference. First operand 1225 states and 1728 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:23,239 INFO L93 Difference]: Finished difference Result 2599 states and 3653 transitions. [2025-03-04 01:42:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:42:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-03-04 01:42:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:23,247 INFO L225 Difference]: With dead ends: 2599 [2025-03-04 01:42:23,247 INFO L226 Difference]: Without dead ends: 1377 [2025-03-04 01:42:23,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:42:23,249 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 77 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:23,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1912 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:42:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-04 01:42:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1231. [2025-03-04 01:42:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1140 states have (on average 1.3912280701754387) internal successors, (1586), 1149 states have internal predecessors, (1586), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1734 transitions. [2025-03-04 01:42:23,298 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1734 transitions. Word has length 155 [2025-03-04 01:42:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1734 transitions. [2025-03-04 01:42:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:42:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1734 transitions. [2025-03-04 01:42:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:23,299 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:42:23,300 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 758804075, now seen corresponding path program 1 times [2025-03-04 01:42:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292168010] [2025-03-04 01:42:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:23,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:23,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:23,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292168010] [2025-03-04 01:42:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292168010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:42:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416243193] [2025-03-04 01:42:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:24,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:42:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:24,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:42:24,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:42:24,036 INFO L87 Difference]: Start difference. First operand 1231 states and 1734 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:24,375 INFO L93 Difference]: Finished difference Result 2496 states and 3514 transitions. [2025-03-04 01:42:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:42:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:42:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:24,379 INFO L225 Difference]: With dead ends: 2496 [2025-03-04 01:42:24,379 INFO L226 Difference]: Without dead ends: 1268 [2025-03-04 01:42:24,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-04 01:42:24,381 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:24,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 722 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:42:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-04 01:42:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1231. [2025-03-04 01:42:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1140 states have (on average 1.3859649122807018) internal successors, (1580), 1149 states have internal predecessors, (1580), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1728 transitions. [2025-03-04 01:42:24,428 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1728 transitions. Word has length 155 [2025-03-04 01:42:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1728 transitions. [2025-03-04 01:42:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1728 transitions. [2025-03-04 01:42:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:24,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:24,429 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:24,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:42:24,429 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash 253245450, now seen corresponding path program 1 times [2025-03-04 01:42:24,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:24,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222858788] [2025-03-04 01:42:24,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:24,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:24,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:24,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:24,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222858788] [2025-03-04 01:42:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222858788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:42:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902686247] [2025-03-04 01:42:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:25,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:42:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:25,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:42:25,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:42:25,511 INFO L87 Difference]: Start difference. First operand 1231 states and 1728 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:26,531 INFO L93 Difference]: Finished difference Result 2569 states and 3602 transitions. [2025-03-04 01:42:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:42:26,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:42:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:26,537 INFO L225 Difference]: With dead ends: 2569 [2025-03-04 01:42:26,537 INFO L226 Difference]: Without dead ends: 1341 [2025-03-04 01:42:26,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:42:26,539 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:26,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1756 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:42:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-03-04 01:42:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1235. [2025-03-04 01:42:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1144 states have (on average 1.3846153846153846) internal successors, (1584), 1153 states have internal predecessors, (1584), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1732 transitions. [2025-03-04 01:42:26,599 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1732 transitions. Word has length 155 [2025-03-04 01:42:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:26,599 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1732 transitions. [2025-03-04 01:42:26,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1732 transitions. [2025-03-04 01:42:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:42:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:26,600 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:42:26,601 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1343942186, now seen corresponding path program 1 times [2025-03-04 01:42:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745674616] [2025-03-04 01:42:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:26,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:42:26,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:42:26,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:26,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745674616] [2025-03-04 01:42:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745674616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:42:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867803707] [2025-03-04 01:42:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:27,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:42:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:42:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:42:27,557 INFO L87 Difference]: Start difference. First operand 1235 states and 1732 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:28,414 INFO L93 Difference]: Finished difference Result 2568 states and 3598 transitions. [2025-03-04 01:42:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:42:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:42:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:28,417 INFO L225 Difference]: With dead ends: 2568 [2025-03-04 01:42:28,417 INFO L226 Difference]: Without dead ends: 1336 [2025-03-04 01:42:28,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:42:28,419 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 64 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:28,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1638 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:42:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-03-04 01:42:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1224. [2025-03-04 01:42:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1133 states have (on average 1.3857016769638129) internal successors, (1570), 1142 states have internal predecessors, (1570), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1718 transitions. [2025-03-04 01:42:28,465 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1718 transitions. Word has length 155 [2025-03-04 01:42:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1718 transitions. [2025-03-04 01:42:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1718 transitions. [2025-03-04 01:42:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:42:28,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:28,467 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:28,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:42:28,467 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:28,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1648526710, now seen corresponding path program 1 times [2025-03-04 01:42:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:28,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856623258] [2025-03-04 01:42:28,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:28,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:42:28,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:42:28,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:28,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:42:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856623258] [2025-03-04 01:42:28,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856623258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252828213] [2025-03-04 01:42:28,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:28,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:28,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:28,585 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-04 01:42:28,585 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-04 01:42:28,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:42:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:42:28,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:28,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:28,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:42:28,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:28,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252828213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:42:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366390861] [2025-03-04 01:42:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:42:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:42:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:42:28,867 INFO L87 Difference]: Start difference. First operand 1224 states and 1718 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:28,937 INFO L93 Difference]: Finished difference Result 2489 states and 3488 transitions. [2025-03-04 01:42:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:42:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-03-04 01:42:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:28,941 INFO L225 Difference]: With dead ends: 2489 [2025-03-04 01:42:28,941 INFO L226 Difference]: Without dead ends: 1268 [2025-03-04 01:42:28,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:42:28,943 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:28,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-04 01:42:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1235. [2025-03-04 01:42:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1144 states have (on average 1.381993006993007) internal successors, (1581), 1153 states have internal predecessors, (1581), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1729 transitions. [2025-03-04 01:42:28,990 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1729 transitions. Word has length 156 [2025-03-04 01:42:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1729 transitions. [2025-03-04 01:42:28,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1729 transitions. [2025-03-04 01:42:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:42:28,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:28,991 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:28,999 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-04 01:42:29,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:29,192 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1284390408, now seen corresponding path program 1 times [2025-03-04 01:42:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187763783] [2025-03-04 01:42:29,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:29,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:42:29,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:42:29,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:29,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187763783] [2025-03-04 01:42:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187763783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:42:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581761715] [2025-03-04 01:42:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:42:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:29,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:42:29,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:42:29,316 INFO L87 Difference]: Start difference. First operand 1235 states and 1729 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:29,686 INFO L93 Difference]: Finished difference Result 3454 states and 4777 transitions. [2025-03-04 01:42:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:42:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:42:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:29,691 INFO L225 Difference]: With dead ends: 3454 [2025-03-04 01:42:29,691 INFO L226 Difference]: Without dead ends: 2222 [2025-03-04 01:42:29,693 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-04 01:42:29,693 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 137 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:29,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 342 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:42:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-04 01:42:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1471. [2025-03-04 01:42:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1380 states have (on average 1.3268115942028986) internal successors, (1831), 1389 states have internal predecessors, (1831), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 01:42:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1979 transitions. [2025-03-04 01:42:29,747 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1979 transitions. Word has length 158 [2025-03-04 01:42:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:29,748 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1979 transitions. [2025-03-04 01:42:29,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1979 transitions. [2025-03-04 01:42:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:42:29,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:29,749 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:29,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:42:29,749 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:29,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1049630179, now seen corresponding path program 1 times [2025-03-04 01:42:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367074656] [2025-03-04 01:42:29,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:29,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:42:29,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:42:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367074656] [2025-03-04 01:42:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367074656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:30,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:42:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129370946] [2025-03-04 01:42:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:30,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:42:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:30,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:42:30,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:30,091 INFO L87 Difference]: Start difference. First operand 1471 states and 1979 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:30,656 INFO L93 Difference]: Finished difference Result 3192 states and 4183 transitions. [2025-03-04 01:42:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:42:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-04 01:42:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:30,662 INFO L225 Difference]: With dead ends: 3192 [2025-03-04 01:42:30,662 INFO L226 Difference]: Without dead ends: 3190 [2025-03-04 01:42:30,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:42:30,663 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 254 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:30,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 843 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:42:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2025-03-04 01:42:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 2685. [2025-03-04 01:42:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2512 states have (on average 1.2914012738853504) internal successors, (3244), 2532 states have internal predecessors, (3244), 140 states have call successors, (140), 32 states have call predecessors, (140), 32 states have return successors, (140), 120 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:42:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3524 transitions. [2025-03-04 01:42:30,766 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3524 transitions. Word has length 158 [2025-03-04 01:42:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3524 transitions. [2025-03-04 01:42:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:42:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3524 transitions. [2025-03-04 01:42:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:42:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:30,768 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:42:30,768 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2007592321, now seen corresponding path program 1 times [2025-03-04 01:42:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675574580] [2025-03-04 01:42:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:42:30,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:42:30,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675574580] [2025-03-04 01:42:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675574580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:42:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880380931] [2025-03-04 01:42:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:31,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:42:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:31,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:42:31,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:42:31,265 INFO L87 Difference]: Start difference. First operand 2685 states and 3524 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:31,856 INFO L93 Difference]: Finished difference Result 7815 states and 10256 transitions. [2025-03-04 01:42:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:42:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-03-04 01:42:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:31,865 INFO L225 Difference]: With dead ends: 7815 [2025-03-04 01:42:31,866 INFO L226 Difference]: Without dead ends: 5133 [2025-03-04 01:42:31,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-04 01:42:31,869 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 84 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:31,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 759 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:42:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-03-04 01:42:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5127. [2025-03-04 01:42:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4810 states have (on average 1.2852390852390851) internal successors, (6182), 4852 states have internal predecessors, (6182), 252 states have call successors, (252), 64 states have call predecessors, (252), 64 states have return successors, (252), 210 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-04 01:42:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 6686 transitions. [2025-03-04 01:42:32,088 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 6686 transitions. Word has length 160 [2025-03-04 01:42:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:32,088 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 6686 transitions. [2025-03-04 01:42:32,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:42:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 6686 transitions. [2025-03-04 01:42:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:42:32,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:32,092 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:42:32,092 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -640600118, now seen corresponding path program 1 times [2025-03-04 01:42:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179897506] [2025-03-04 01:42:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:32,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:42:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:42:32,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:42:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:32,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179897506] [2025-03-04 01:42:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179897506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:42:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:42:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818919848] [2025-03-04 01:42:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:32,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:42:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:32,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:42:32,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:42:32,741 INFO L87 Difference]: Start difference. First operand 5127 states and 6686 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)