./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.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-71.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 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:43:10,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:43:10,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:43:10,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:43:10,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:43:10,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:43:10,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:43:10,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:43:10,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:43:10,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:43:10,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:43:10,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:43:10,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:43:10,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:43:10,545 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:43:10,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:43:10,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:43:10,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:43:10,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:43:10,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:43:10,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:43:10,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:43:10,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:43:10,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:43:10,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:43:10,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:43:10,548 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 -> 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc [2025-03-04 01:43:10,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:43:10,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:43:10,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:43:10,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:43:10,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:43:10,759 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-71.i [2025-03-04 01:43:11,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889e1a5c/9a4853b4f6954fdd91a87c305afb4998/FLAG63f24e7b3 [2025-03-04 01:43:12,084 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:43:12,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2025-03-04 01:43:12,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889e1a5c/9a4853b4f6954fdd91a87c305afb4998/FLAG63f24e7b3 [2025-03-04 01:43:12,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6889e1a5c/9a4853b4f6954fdd91a87c305afb4998 [2025-03-04 01:43:12,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:43:12,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:43:12,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:43:12,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:43:12,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:43:12,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12, skipping insertion in model container [2025-03-04 01:43:12,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:43:12,228 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-71.i[916,929] [2025-03-04 01:43:12,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:43:12,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:43:12,310 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-71.i[916,929] [2025-03-04 01:43:12,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:43:12,371 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:43:12,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12 WrapperNode [2025-03-04 01:43:12,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:43:12,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:43:12,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:43:12,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:43:12,378 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:43:12" (1/1) ... [2025-03-04 01:43:12,392 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:43:12" (1/1) ... [2025-03-04 01:43:12,425 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-03-04 01:43:12,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:43:12,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:43:12,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:43:12,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:43:12,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,464 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-04 01:43:12,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:43:12,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:43:12,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:43:12,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:43:12,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (1/1) ... [2025-03-04 01:43:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:43:12,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:12,533 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:43:12,539 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:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:43:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:43:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:43:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:43:12,637 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:43:12,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:43:13,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-04 01:43:13,093 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-04 01:43:13,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:43:13,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:43:13,101 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:43:13,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:43:13 BoogieIcfgContainer [2025-03-04 01:43:13,101 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:43:13,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:43:13,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:43:13,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:43:13,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:43:12" (1/3) ... [2025-03-04 01:43:13,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8d2416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:43:13, skipping insertion in model container [2025-03-04 01:43:13,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:12" (2/3) ... [2025-03-04 01:43:13,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8d2416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:43:13, skipping insertion in model container [2025-03-04 01:43:13,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:43:13" (3/3) ... [2025-03-04 01:43:13,109 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-71.i [2025-03-04 01:43:13,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:43:13,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:43:13,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:43:13,177 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;@54c743e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:43:13,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:43:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:43:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:43:13,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:13,190 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:13,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1033032455, now seen corresponding path program 1 times [2025-03-04 01:43:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144942154] [2025-03-04 01:43:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:13,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:43:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:43:13,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:13,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:13,469 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:43:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144942154] [2025-03-04 01:43:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144942154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909523593] [2025-03-04 01:43:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:13,473 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:43:13,494 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:43:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:43:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:43:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:13,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:43:13,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:13,712 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:43:13,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909523593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:43:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525530233] [2025-03-04 01:43:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:13,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:43:13,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:13,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:43:13,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:43:13,734 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:43:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:13,760 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-03-04 01:43:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:43:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-03-04 01:43:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:13,768 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:43:13,768 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:43:13,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:43:13,774 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:13,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:43:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:43:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:43:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-04 01:43:13,813 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-03-04 01:43:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:13,813 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-04 01:43:13,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:43:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-04 01:43:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:43:13,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:13,815 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:13,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:43:14,016 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:43:14,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:14,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -611693478, now seen corresponding path program 1 times [2025-03-04 01:43:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596516634] [2025-03-04 01:43:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:14,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:43:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:43:14,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:14,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:14,295 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:43:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596516634] [2025-03-04 01:43:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596516634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:43:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084269564] [2025-03-04 01:43:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:43:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:14,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:43:14,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:14,297 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:14,335 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-04 01:43:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:43:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-04 01:43:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:14,339 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:43:14,339 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:43:14,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:14,340 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:14,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:43:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-04 01:43:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:43:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-03-04 01:43:14,352 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2025-03-04 01:43:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-03-04 01:43:14,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-03-04 01:43:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:43:14,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:14,372 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:14,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:43:14,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 275810203, now seen corresponding path program 1 times [2025-03-04 01:43:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747148213] [2025-03-04 01:43:14,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:14,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:43:14,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:43:14,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:14,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:14,557 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:43:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747148213] [2025-03-04 01:43:14,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747148213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:14,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:43:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555183994] [2025-03-04 01:43:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:43:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:14,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:43:14,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:14,559 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:14,588 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2025-03-04 01:43:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:43:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-04 01:43:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:14,590 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:43:14,590 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:43:14,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:43:14,591 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:14,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:43:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:43:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:43:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-03-04 01:43:14,598 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2025-03-04 01:43:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:14,598 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-03-04 01:43:14,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-03-04 01:43:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:43:14,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:14,603 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:14,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:43:14,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 276733724, now seen corresponding path program 1 times [2025-03-04 01:43:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805429732] [2025-03-04 01:43:14,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:43:14,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:43:14,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:15,397 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:43:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805429732] [2025-03-04 01:43:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805429732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611709274] [2025-03-04 01:43:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:15,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:15,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:15,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:15,400 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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:43:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:15,832 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2025-03-04 01:43:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 144 [2025-03-04 01:43:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:15,835 INFO L225 Difference]: With dead ends: 290 [2025-03-04 01:43:15,835 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 01:43:15,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:43:15,836 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 107 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:15,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 537 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 01:43:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-03-04 01:43:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3125) internal successors, (189), 145 states have internal predecessors, (189), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:43:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 247 transitions. [2025-03-04 01:43:15,858 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 247 transitions. Word has length 144 [2025-03-04 01:43:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 247 transitions. [2025-03-04 01:43:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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:43:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 247 transitions. [2025-03-04 01:43:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:43:15,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:15,860 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:43:15,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 5282066, now seen corresponding path program 1 times [2025-03-04 01:43:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848270671] [2025-03-04 01:43:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:15,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:43:15,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:43:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:16,822 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:43:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848270671] [2025-03-04 01:43:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848270671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021734106] [2025-03-04 01:43:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:16,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:16,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:16,825 INFO L87 Difference]: Start difference. First operand 176 states and 247 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 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:43:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:17,298 INFO L93 Difference]: Finished difference Result 435 states and 613 transitions. [2025-03-04 01:43:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:43:17,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 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 145 [2025-03-04 01:43:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:17,303 INFO L225 Difference]: With dead ends: 435 [2025-03-04 01:43:17,303 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 01:43:17,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:17,304 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:17,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 669 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 01:43:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 185. [2025-03-04 01:43:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.326797385620915) internal successors, (203), 154 states have internal predecessors, (203), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:43:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2025-03-04 01:43:17,329 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 145 [2025-03-04 01:43:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2025-03-04 01:43:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 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:43:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2025-03-04 01:43:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:17,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:17,334 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:43:17,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -446025639, now seen corresponding path program 1 times [2025-03-04 01:43:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014067552] [2025-03-04 01:43:17,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:17,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:17,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:17,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:17,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:18,222 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:43:18,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014067552] [2025-03-04 01:43:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014067552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:18,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:18,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:43:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458779039] [2025-03-04 01:43:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:43:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:18,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:43:18,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:18,228 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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:43:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:18,520 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2025-03-04 01:43:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:43:18,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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 146 [2025-03-04 01:43:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:18,522 INFO L225 Difference]: With dead ends: 425 [2025-03-04 01:43:18,522 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 01:43:18,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:43:18,523 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 74 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 870 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:43:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 870 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 01:43:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-03-04 01:43:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 203 states have internal predecessors, (264), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:43:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 334 transitions. [2025-03-04 01:43:18,535 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 334 transitions. Word has length 146 [2025-03-04 01:43:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:18,535 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 334 transitions. [2025-03-04 01:43:18,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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:43:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 334 transitions. [2025-03-04 01:43:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:18,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:18,537 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:18,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:43:18,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:18,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1255867333, now seen corresponding path program 1 times [2025-03-04 01:43:18,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:18,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280468928] [2025-03-04 01:43:18,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:18,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:18,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:19,208 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:43:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280468928] [2025-03-04 01:43:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280468928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:19,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:19,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000014236] [2025-03-04 01:43:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:19,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:19,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:19,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:19,210 INFO L87 Difference]: Start difference. First operand 240 states and 334 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:43:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:19,394 INFO L93 Difference]: Finished difference Result 554 states and 770 transitions. [2025-03-04 01:43:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 146 [2025-03-04 01:43:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:19,397 INFO L225 Difference]: With dead ends: 554 [2025-03-04 01:43:19,397 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 01:43:19,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:43:19,398 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:19,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 361 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 01:43:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2025-03-04 01:43:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 211 states have (on average 1.3127962085308056) internal successors, (277), 213 states have internal predecessors, (277), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:43:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2025-03-04 01:43:19,409 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 146 [2025-03-04 01:43:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:19,410 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2025-03-04 01:43:19,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:43:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2025-03-04 01:43:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:19,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:19,411 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:19,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:43:19,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 681936079, now seen corresponding path program 1 times [2025-03-04 01:43:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180331129] [2025-03-04 01:43:19,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:19,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:19,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:19,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:19,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:20,193 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:43:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180331129] [2025-03-04 01:43:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180331129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:43:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602602224] [2025-03-04 01:43:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:43:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:20,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:43:20,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:20,199 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 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:43:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:20,913 INFO L93 Difference]: Finished difference Result 629 states and 864 transitions. [2025-03-04 01:43:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 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 147 [2025-03-04 01:43:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:20,916 INFO L225 Difference]: With dead ends: 629 [2025-03-04 01:43:20,916 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 01:43:20,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:20,917 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 215 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:20,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 741 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:43:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 01:43:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 352. [2025-03-04 01:43:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 295 states have (on average 1.2949152542372881) internal successors, (382), 299 states have internal predecessors, (382), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:43:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2025-03-04 01:43:20,942 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 147 [2025-03-04 01:43:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:20,944 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2025-03-04 01:43:20,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 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:43:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2025-03-04 01:43:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:20,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:20,946 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:20,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:43:20,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:20,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1544609233, now seen corresponding path program 1 times [2025-03-04 01:43:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:20,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162804732] [2025-03-04 01:43:20,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:21,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:21,599 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:43:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162804732] [2025-03-04 01:43:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162804732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:43:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876215667] [2025-03-04 01:43:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:21,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:43:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:21,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:43:21,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:21,601 INFO L87 Difference]: Start difference. First operand 352 states and 484 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (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:43:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:21,904 INFO L93 Difference]: Finished difference Result 815 states and 1114 transitions. [2025-03-04 01:43:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:21,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (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 147 [2025-03-04 01:43:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:21,907 INFO L225 Difference]: With dead ends: 815 [2025-03-04 01:43:21,908 INFO L226 Difference]: Without dead ends: 466 [2025-03-04 01:43:21,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:21,909 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 900 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-04 01:43:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2025-03-04 01:43:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 395 states have (on average 1.2911392405063291) internal successors, (510), 401 states have internal predecessors, (510), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 01:43:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 628 transitions. [2025-03-04 01:43:21,929 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 628 transitions. Word has length 147 [2025-03-04 01:43:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:21,930 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 628 transitions. [2025-03-04 01:43:21,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (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:43:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 628 transitions. [2025-03-04 01:43:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:21,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:21,935 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:43:21,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -37057424, now seen corresponding path program 1 times [2025-03-04 01:43:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735550348] [2025-03-04 01:43:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:21,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:23,313 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:43:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:23,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735550348] [2025-03-04 01:43:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735550348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:23,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48214423] [2025-03-04 01:43:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:23,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:23,314 INFO L87 Difference]: Start difference. First operand 462 states and 628 transitions. Second operand has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 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:43:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:24,147 INFO L93 Difference]: Finished difference Result 1031 states and 1385 transitions. [2025-03-04 01:43:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:43:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 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 147 [2025-03-04 01:43:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:24,150 INFO L225 Difference]: With dead ends: 1031 [2025-03-04 01:43:24,150 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 01:43:24,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:43:24,152 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 142 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:24,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 965 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:43:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 01:43:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 493. [2025-03-04 01:43:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 421 states have (on average 1.2850356294536818) internal successors, (541), 428 states have internal predecessors, (541), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:43:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 663 transitions. [2025-03-04 01:43:24,182 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 663 transitions. Word has length 147 [2025-03-04 01:43:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 663 transitions. [2025-03-04 01:43:24,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 6.111111111111111) internal successors, (55), 13 states have internal predecessors, (55), 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:43:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 663 transitions. [2025-03-04 01:43:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:24,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:24,185 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:43:24,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -248408337, now seen corresponding path program 1 times [2025-03-04 01:43:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17628725] [2025-03-04 01:43:24,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:24,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:24,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:24,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:25,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:43:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17628725] [2025-03-04 01:43:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17628725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:25,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:43:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967889407] [2025-03-04 01:43:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:25,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:43:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:25,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:43:25,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:43:25,219 INFO L87 Difference]: Start difference. First operand 493 states and 663 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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:43:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:25,822 INFO L93 Difference]: Finished difference Result 969 states and 1305 transitions. [2025-03-04 01:43:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:43:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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 147 [2025-03-04 01:43:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:25,825 INFO L225 Difference]: With dead ends: 969 [2025-03-04 01:43:25,825 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 01:43:25,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:25,827 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:25,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 852 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 01:43:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 471. [2025-03-04 01:43:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 406 states have internal predecessors, (510), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:43:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 632 transitions. [2025-03-04 01:43:25,853 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 632 transitions. Word has length 147 [2025-03-04 01:43:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:25,854 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 632 transitions. [2025-03-04 01:43:25,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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:43:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 632 transitions. [2025-03-04 01:43:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:25,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:25,856 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:43:25,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 673148720, now seen corresponding path program 1 times [2025-03-04 01:43:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:25,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620197667] [2025-03-04 01:43:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:25,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:26,974 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:43:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620197667] [2025-03-04 01:43:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620197667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:43:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623459940] [2025-03-04 01:43:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:26,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:43:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:43:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:43:26,977 INFO L87 Difference]: Start difference. First operand 471 states and 632 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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:43:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:27,578 INFO L93 Difference]: Finished difference Result 941 states and 1259 transitions. [2025-03-04 01:43:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:43:27,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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 147 [2025-03-04 01:43:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:27,580 INFO L225 Difference]: With dead ends: 941 [2025-03-04 01:43:27,580 INFO L226 Difference]: Without dead ends: 482 [2025-03-04 01:43:27,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:27,581 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:27,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 833 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-04 01:43:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 470. [2025-03-04 01:43:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 399 states have (on average 1.2731829573934836) internal successors, (508), 405 states have internal predecessors, (508), 59 states have call successors, (59), 11 states have call predecessors, (59), 11 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 01:43:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 626 transitions. [2025-03-04 01:43:27,602 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 626 transitions. Word has length 147 [2025-03-04 01:43:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:27,602 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 626 transitions. [2025-03-04 01:43:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 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:43:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 626 transitions. [2025-03-04 01:43:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:43:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:27,603 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:27,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:43:27,604 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2114266767, now seen corresponding path program 1 times [2025-03-04 01:43:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006337590] [2025-03-04 01:43:27,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:43:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:43:27,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:27,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:27,800 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:43:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006337590] [2025-03-04 01:43:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006337590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001009713] [2025-03-04 01:43:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:27,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:27,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:27,802 INFO L87 Difference]: Start difference. First operand 470 states and 626 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:28,075 INFO L93 Difference]: Finished difference Result 1021 states and 1358 transitions. [2025-03-04 01:43:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-04 01:43:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:28,078 INFO L225 Difference]: With dead ends: 1021 [2025-03-04 01:43:28,078 INFO L226 Difference]: Without dead ends: 554 [2025-03-04 01:43:28,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:43:28,082 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 104 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:28,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1092 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-04 01:43:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 541. [2025-03-04 01:43:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 440 states have (on average 1.2431818181818182) internal successors, (547), 447 states have internal predecessors, (547), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:43:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 715 transitions. [2025-03-04 01:43:28,115 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 715 transitions. Word has length 147 [2025-03-04 01:43:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:28,116 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 715 transitions. [2025-03-04 01:43:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 715 transitions. [2025-03-04 01:43:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:28,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:28,117 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:28,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:43:28,117 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1460447311, now seen corresponding path program 1 times [2025-03-04 01:43:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237366179] [2025-03-04 01:43:28,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:28,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:28,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:28,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:28,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:29,381 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:43:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237366179] [2025-03-04 01:43:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237366179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389257189] [2025-03-04 01:43:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:29,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:29,383 INFO L87 Difference]: Start difference. First operand 541 states and 715 transitions. Second operand has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 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:43:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:30,174 INFO L93 Difference]: Finished difference Result 1186 states and 1574 transitions. [2025-03-04 01:43:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 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 148 [2025-03-04 01:43:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:30,177 INFO L225 Difference]: With dead ends: 1186 [2025-03-04 01:43:30,177 INFO L226 Difference]: Without dead ends: 661 [2025-03-04 01:43:30,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:43:30,179 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:30,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 880 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:43:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-04 01:43:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2025-03-04 01:43:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 550 states have (on average 1.2672727272727273) internal successors, (697), 559 states have internal predecessors, (697), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:43:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 873 transitions. [2025-03-04 01:43:30,205 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 873 transitions. Word has length 148 [2025-03-04 01:43:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 873 transitions. [2025-03-04 01:43:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.6) internal successors, (56), 13 states have internal predecessors, (56), 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:43:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 873 transitions. [2025-03-04 01:43:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:30,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:30,207 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:30,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:43:30,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 949913134, now seen corresponding path program 1 times [2025-03-04 01:43:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354718979] [2025-03-04 01:43:30,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:30,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:30,982 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:43:30,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:30,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354718979] [2025-03-04 01:43:30,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354718979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41338994] [2025-03-04 01:43:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:30,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:30,985 INFO L87 Difference]: Start difference. First operand 657 states and 873 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 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:43:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:31,802 INFO L93 Difference]: Finished difference Result 1554 states and 2076 transitions. [2025-03-04 01:43:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:43:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 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 148 [2025-03-04 01:43:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:31,806 INFO L225 Difference]: With dead ends: 1554 [2025-03-04 01:43:31,806 INFO L226 Difference]: Without dead ends: 913 [2025-03-04 01:43:31,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:43:31,809 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 86 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:31,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1160 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:43:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-04 01:43:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 857. [2025-03-04 01:43:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 737 states have (on average 1.2890094979647218) internal successors, (950), 749 states have internal predecessors, (950), 98 states have call successors, (98), 21 states have call predecessors, (98), 21 states have return successors, (98), 86 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 01:43:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1146 transitions. [2025-03-04 01:43:31,844 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1146 transitions. Word has length 148 [2025-03-04 01:43:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1146 transitions. [2025-03-04 01:43:31,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 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:43:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1146 transitions. [2025-03-04 01:43:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:31,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:31,846 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:43:31,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:31,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1457907827, now seen corresponding path program 1 times [2025-03-04 01:43:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375881009] [2025-03-04 01:43:31,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:31,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:31,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:31,974 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:43:31,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375881009] [2025-03-04 01:43:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375881009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:31,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980188638] [2025-03-04 01:43:31,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:31,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:31,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:31,976 INFO L87 Difference]: Start difference. First operand 857 states and 1146 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:32,157 INFO L93 Difference]: Finished difference Result 1931 states and 2576 transitions. [2025-03-04 01:43:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-04 01:43:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:32,166 INFO L225 Difference]: With dead ends: 1931 [2025-03-04 01:43:32,166 INFO L226 Difference]: Without dead ends: 1090 [2025-03-04 01:43:32,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:32,169 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 100 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:32,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 359 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:43:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-04 01:43:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 939. [2025-03-04 01:43:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 802 states have (on average 1.2793017456359101) internal successors, (1026), 815 states have internal predecessors, (1026), 112 states have call successors, (112), 24 states have call predecessors, (112), 24 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:43:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1250 transitions. [2025-03-04 01:43:32,226 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1250 transitions. Word has length 148 [2025-03-04 01:43:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:32,226 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1250 transitions. [2025-03-04 01:43:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1250 transitions. [2025-03-04 01:43:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:32,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:32,228 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:43:32,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1459616842, now seen corresponding path program 1 times [2025-03-04 01:43:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068891789] [2025-03-04 01:43:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:32,548 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:43:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068891789] [2025-03-04 01:43:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068891789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876160064] [2025-03-04 01:43:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:32,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:32,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:32,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:32,550 INFO L87 Difference]: Start difference. First operand 939 states and 1250 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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:43:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:32,868 INFO L93 Difference]: Finished difference Result 1911 states and 2544 transitions. [2025-03-04 01:43:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 148 [2025-03-04 01:43:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:32,872 INFO L225 Difference]: With dead ends: 1911 [2025-03-04 01:43:32,872 INFO L226 Difference]: Without dead ends: 1000 [2025-03-04 01:43:32,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:43:32,873 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 90 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:32,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 414 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-03-04 01:43:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 946. [2025-03-04 01:43:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 809 states have (on average 1.2793572311495673) internal successors, (1035), 822 states have internal predecessors, (1035), 112 states have call successors, (112), 24 states have call predecessors, (112), 24 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:43:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1259 transitions. [2025-03-04 01:43:32,909 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1259 transitions. Word has length 148 [2025-03-04 01:43:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1259 transitions. [2025-03-04 01:43:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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:43:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1259 transitions. [2025-03-04 01:43:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:32,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:32,912 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:32,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:43:32,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -106307145, now seen corresponding path program 1 times [2025-03-04 01:43:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424636652] [2025-03-04 01:43:32,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:32,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:32,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:32,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:33,244 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:43:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424636652] [2025-03-04 01:43:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424636652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:33,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:33,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:33,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195481392] [2025-03-04 01:43:33,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:33,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:33,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:33,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:33,246 INFO L87 Difference]: Start difference. First operand 946 states and 1259 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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:43:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:33,515 INFO L93 Difference]: Finished difference Result 1864 states and 2479 transitions. [2025-03-04 01:43:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 148 [2025-03-04 01:43:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:33,520 INFO L225 Difference]: With dead ends: 1864 [2025-03-04 01:43:33,520 INFO L226 Difference]: Without dead ends: 946 [2025-03-04 01:43:33,521 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:43:33,522 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 60 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:33,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 606 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-04 01:43:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 943. [2025-03-04 01:43:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 805 states have (on average 1.2757763975155278) internal successors, (1027), 818 states have internal predecessors, (1027), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:43:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1251 transitions. [2025-03-04 01:43:33,557 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1251 transitions. Word has length 148 [2025-03-04 01:43:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:33,557 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1251 transitions. [2025-03-04 01:43:33,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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:43:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1251 transitions. [2025-03-04 01:43:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:43:33,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:33,561 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:33,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:43:33,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:33,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1566019195, now seen corresponding path program 1 times [2025-03-04 01:43:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496689464] [2025-03-04 01:43:33,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:43:33,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:43:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:33,995 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:43:33,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:33,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496689464] [2025-03-04 01:43:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496689464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:33,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:33,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115412457] [2025-03-04 01:43:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:33,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:33,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:33,998 INFO L87 Difference]: Start difference. First operand 943 states and 1251 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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:43:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:34,212 INFO L93 Difference]: Finished difference Result 1800 states and 2385 transitions. [2025-03-04 01:43:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 149 [2025-03-04 01:43:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:34,216 INFO L225 Difference]: With dead ends: 1800 [2025-03-04 01:43:34,216 INFO L226 Difference]: Without dead ends: 885 [2025-03-04 01:43:34,217 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:43:34,218 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 51 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:34,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 557 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-04 01:43:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2025-03-04 01:43:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 745 states have (on average 1.25503355704698) internal successors, (935), 758 states have internal predecessors, (935), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:43:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1159 transitions. [2025-03-04 01:43:34,248 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1159 transitions. Word has length 149 [2025-03-04 01:43:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1159 transitions. [2025-03-04 01:43:34,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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:43:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1159 transitions. [2025-03-04 01:43:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:43:34,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:34,249 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:43:34,250 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2013938487, now seen corresponding path program 1 times [2025-03-04 01:43:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459504889] [2025-03-04 01:43:34,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:43:34,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:43:34,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:34,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:35,827 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:43:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459504889] [2025-03-04 01:43:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459504889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:35,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130839019] [2025-03-04 01:43:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:35,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:35,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:35,828 INFO L87 Difference]: Start difference. First operand 883 states and 1159 transitions. Second operand has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 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:43:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:36,445 INFO L93 Difference]: Finished difference Result 1791 states and 2347 transitions. [2025-03-04 01:43:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:43:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 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 149 [2025-03-04 01:43:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:36,449 INFO L225 Difference]: With dead ends: 1791 [2025-03-04 01:43:36,449 INFO L226 Difference]: Without dead ends: 936 [2025-03-04 01:43:36,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:43:36,452 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 203 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1157 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-04 01:43:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 898. [2025-03-04 01:43:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 760 states have (on average 1.2552631578947369) internal successors, (954), 773 states have internal predecessors, (954), 112 states have call successors, (112), 25 states have call predecessors, (112), 25 states have return successors, (112), 99 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:43:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1178 transitions. [2025-03-04 01:43:36,488 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1178 transitions. Word has length 149 [2025-03-04 01:43:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:36,488 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1178 transitions. [2025-03-04 01:43:36,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.7) internal successors, (57), 13 states have internal predecessors, (57), 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:43:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1178 transitions. [2025-03-04 01:43:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:43:36,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:36,490 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:43:36,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1036264328, now seen corresponding path program 1 times [2025-03-04 01:43:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:36,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706490357] [2025-03-04 01:43:36,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:36,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:43:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:43:36,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:36,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:37,385 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:43:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:37,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706490357] [2025-03-04 01:43:37,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706490357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:37,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:37,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:43:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820403965] [2025-03-04 01:43:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:37,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:43:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:37,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:43:37,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:37,387 INFO L87 Difference]: Start difference. First operand 898 states and 1178 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 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:43:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:37,739 INFO L93 Difference]: Finished difference Result 1796 states and 2353 transitions. [2025-03-04 01:43:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 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 149 [2025-03-04 01:43:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:37,743 INFO L225 Difference]: With dead ends: 1796 [2025-03-04 01:43:37,744 INFO L226 Difference]: Without dead ends: 926 [2025-03-04 01:43:37,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:43:37,746 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:37,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 795 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-04 01:43:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 822. [2025-03-04 01:43:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 688 states have (on average 1.244186046511628) internal successors, (856), 699 states have internal predecessors, (856), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:43:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1072 transitions. [2025-03-04 01:43:37,780 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1072 transitions. Word has length 149 [2025-03-04 01:43:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1072 transitions. [2025-03-04 01:43:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 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:43:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1072 transitions. [2025-03-04 01:43:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:37,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:37,781 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:43:37,781 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1803376148, now seen corresponding path program 1 times [2025-03-04 01:43:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461315117] [2025-03-04 01:43:37,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:37,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:37,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:37,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:37,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:38,162 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:43:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461315117] [2025-03-04 01:43:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461315117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:38,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135766105] [2025-03-04 01:43:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:38,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:38,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:38,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:38,164 INFO L87 Difference]: Start difference. First operand 822 states and 1072 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (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:43:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:38,377 INFO L93 Difference]: Finished difference Result 1709 states and 2226 transitions. [2025-03-04 01:43:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:38,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (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 150 [2025-03-04 01:43:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:38,381 INFO L225 Difference]: With dead ends: 1709 [2025-03-04 01:43:38,381 INFO L226 Difference]: Without dead ends: 915 [2025-03-04 01:43:38,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:43:38,383 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 65 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:38,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 501 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-04 01:43:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 822. [2025-03-04 01:43:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 688 states have (on average 1.242732558139535) internal successors, (855), 699 states have internal predecessors, (855), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:43:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1071 transitions. [2025-03-04 01:43:38,414 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1071 transitions. Word has length 150 [2025-03-04 01:43:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:38,414 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1071 transitions. [2025-03-04 01:43:38,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (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:43:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1071 transitions. [2025-03-04 01:43:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:38,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:38,415 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:38,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:43:38,415 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:38,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1772356341, now seen corresponding path program 1 times [2025-03-04 01:43:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:38,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644565719] [2025-03-04 01:43:38,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:38,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:38,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:38,859 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:43:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644565719] [2025-03-04 01:43:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644565719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:43:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39274548] [2025-03-04 01:43:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:38,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:43:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:38,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:43:38,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:38,860 INFO L87 Difference]: Start difference. First operand 822 states and 1071 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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:43:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:39,164 INFO L93 Difference]: Finished difference Result 1690 states and 2198 transitions. [2025-03-04 01:43:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:39,168 INFO L225 Difference]: With dead ends: 1690 [2025-03-04 01:43:39,168 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 01:43:39,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:43:39,170 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:39,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 824 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 01:43:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 826. [2025-03-04 01:43:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 689 states have (on average 1.2409288824383164) internal successors, (855), 700 states have internal predecessors, (855), 110 states have call successors, (110), 26 states have call predecessors, (110), 26 states have return successors, (110), 99 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 01:43:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1075 transitions. [2025-03-04 01:43:39,200 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1075 transitions. Word has length 150 [2025-03-04 01:43:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:39,201 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1075 transitions. [2025-03-04 01:43:39,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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:43:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1075 transitions. [2025-03-04 01:43:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:39,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:39,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:43:39,202 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1955179441, now seen corresponding path program 1 times [2025-03-04 01:43:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234010202] [2025-03-04 01:43:39,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:39,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:39,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:39,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:39,948 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:43:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234010202] [2025-03-04 01:43:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234010202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:43:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946102198] [2025-03-04 01:43:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:43:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:39,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:43:39,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:39,949 INFO L87 Difference]: Start difference. First operand 826 states and 1075 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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:43:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:40,291 INFO L93 Difference]: Finished difference Result 1675 states and 2180 transitions. [2025-03-04 01:43:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:43:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:40,295 INFO L225 Difference]: With dead ends: 1675 [2025-03-04 01:43:40,295 INFO L226 Difference]: Without dead ends: 873 [2025-03-04 01:43:40,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:40,296 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:40,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 588 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-04 01:43:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824. [2025-03-04 01:43:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 687 states have (on average 1.2358078602620088) internal successors, (849), 698 states have internal predecessors, (849), 110 states have call successors, (110), 26 states have call predecessors, (110), 26 states have return successors, (110), 99 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 01:43:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1069 transitions. [2025-03-04 01:43:40,329 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1069 transitions. Word has length 150 [2025-03-04 01:43:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:40,329 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1069 transitions. [2025-03-04 01:43:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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:43:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1069 transitions. [2025-03-04 01:43:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:40,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:40,330 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:40,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:43:40,330 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:40,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash 958107088, now seen corresponding path program 1 times [2025-03-04 01:43:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:40,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398762137] [2025-03-04 01:43:40,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:40,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:40,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:40,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:40,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:40,737 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:43:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398762137] [2025-03-04 01:43:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398762137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:40,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:43:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796528953] [2025-03-04 01:43:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:40,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:43:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:40,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:43:40,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:40,738 INFO L87 Difference]: Start difference. First operand 824 states and 1069 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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:43:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:41,110 INFO L93 Difference]: Finished difference Result 1687 states and 2186 transitions. [2025-03-04 01:43:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:41,114 INFO L225 Difference]: With dead ends: 1687 [2025-03-04 01:43:41,114 INFO L226 Difference]: Without dead ends: 887 [2025-03-04 01:43:41,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:43:41,115 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 60 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:41,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 971 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-04 01:43:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 789. [2025-03-04 01:43:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 655 states have (on average 1.2305343511450382) internal successors, (806), 665 states have internal predecessors, (806), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 98 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:43:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1022 transitions. [2025-03-04 01:43:41,171 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1022 transitions. Word has length 150 [2025-03-04 01:43:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:41,171 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1022 transitions. [2025-03-04 01:43:41,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 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:43:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1022 transitions. [2025-03-04 01:43:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:41,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:41,173 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:41,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:43:41,173 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:41,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1985943668, now seen corresponding path program 1 times [2025-03-04 01:43:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444647091] [2025-03-04 01:43:41,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:41,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:42,905 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:43:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444647091] [2025-03-04 01:43:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444647091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:43:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712689561] [2025-03-04 01:43:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:42,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:43:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:42,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:43:42,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:43:42,907 INFO L87 Difference]: Start difference. First operand 789 states and 1022 transitions. Second operand has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (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:43:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:43,768 INFO L93 Difference]: Finished difference Result 1657 states and 2146 transitions. [2025-03-04 01:43:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:43:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (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 150 [2025-03-04 01:43:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:43,772 INFO L225 Difference]: With dead ends: 1657 [2025-03-04 01:43:43,772 INFO L226 Difference]: Without dead ends: 892 [2025-03-04 01:43:43,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:43:43,774 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 113 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:43,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1263 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:43:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-04 01:43:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 805. [2025-03-04 01:43:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 670 states have (on average 1.2313432835820894) internal successors, (825), 680 states have internal predecessors, (825), 108 states have call successors, (108), 26 states have call predecessors, (108), 26 states have return successors, (108), 98 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:43:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1041 transitions. [2025-03-04 01:43:43,805 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1041 transitions. Word has length 150 [2025-03-04 01:43:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1041 transitions. [2025-03-04 01:43:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (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:43:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1041 transitions. [2025-03-04 01:43:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:43,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:43,806 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:43,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:43:43,806 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:43,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1798489451, now seen corresponding path program 1 times [2025-03-04 01:43:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035440714] [2025-03-04 01:43:43,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:43,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:43,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:44,571 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:43:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035440714] [2025-03-04 01:43:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035440714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:43:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436845154] [2025-03-04 01:43:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:43:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:44,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:43:44,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:44,572 INFO L87 Difference]: Start difference. First operand 805 states and 1041 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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:43:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:44,879 INFO L93 Difference]: Finished difference Result 1636 states and 2113 transitions. [2025-03-04 01:43:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:43:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:44,883 INFO L225 Difference]: With dead ends: 1636 [2025-03-04 01:43:44,883 INFO L226 Difference]: Without dead ends: 855 [2025-03-04 01:43:44,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:44,885 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:44,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 735 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-04 01:43:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 757. [2025-03-04 01:43:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 629 states have (on average 1.2209856915739268) internal successors, (768), 638 states have internal predecessors, (768), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 972 transitions. [2025-03-04 01:43:44,918 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 972 transitions. Word has length 150 [2025-03-04 01:43:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:44,919 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 972 transitions. [2025-03-04 01:43:44,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 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:43:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 972 transitions. [2025-03-04 01:43:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:44,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:44,920 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:44,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:43:44,920 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:44,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1577119443, now seen corresponding path program 1 times [2025-03-04 01:43:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807822001] [2025-03-04 01:43:44,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:44,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:44,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:46,252 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:43:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:46,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807822001] [2025-03-04 01:43:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807822001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113172193] [2025-03-04 01:43:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:46,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:46,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:46,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:46,254 INFO L87 Difference]: Start difference. First operand 757 states and 972 transitions. Second operand has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 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:43:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:47,029 INFO L93 Difference]: Finished difference Result 1492 states and 1917 transitions. [2025-03-04 01:43:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:43:47,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:47,033 INFO L225 Difference]: With dead ends: 1492 [2025-03-04 01:43:47,033 INFO L226 Difference]: Without dead ends: 759 [2025-03-04 01:43:47,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:43:47,034 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 55 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:47,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1297 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:43:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-04 01:43:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 745. [2025-03-04 01:43:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 617 states have (on average 1.2188006482982172) internal successors, (752), 626 states have internal predecessors, (752), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 956 transitions. [2025-03-04 01:43:47,065 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 956 transitions. Word has length 150 [2025-03-04 01:43:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 956 transitions. [2025-03-04 01:43:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 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:43:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 956 transitions. [2025-03-04 01:43:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:47,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:47,066 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:47,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:43:47,066 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:47,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1262077744, now seen corresponding path program 1 times [2025-03-04 01:43:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177968930] [2025-03-04 01:43:47,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:47,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:47,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:47,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:47,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:48,234 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:43:48,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177968930] [2025-03-04 01:43:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177968930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:43:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019877692] [2025-03-04 01:43:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:48,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:43:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:48,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:43:48,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:43:48,236 INFO L87 Difference]: Start difference. First operand 745 states and 956 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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:43:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:48,995 INFO L93 Difference]: Finished difference Result 1644 states and 2106 transitions. [2025-03-04 01:43:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:43:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:48,999 INFO L225 Difference]: With dead ends: 1644 [2025-03-04 01:43:48,999 INFO L226 Difference]: Without dead ends: 923 [2025-03-04 01:43:49,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:43:49,000 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 134 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:49,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1324 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:43:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-04 01:43:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 755. [2025-03-04 01:43:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 627 states have (on average 1.2216905901116428) internal successors, (766), 636 states have internal predecessors, (766), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 970 transitions. [2025-03-04 01:43:49,032 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 970 transitions. Word has length 150 [2025-03-04 01:43:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:49,032 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 970 transitions. [2025-03-04 01:43:49,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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:43:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 970 transitions. [2025-03-04 01:43:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:49,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:49,034 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:49,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:43:49,034 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:49,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash -994833263, now seen corresponding path program 1 times [2025-03-04 01:43:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660918993] [2025-03-04 01:43:49,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:49,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:49,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:49,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:49,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:50,240 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:43:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660918993] [2025-03-04 01:43:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660918993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:43:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874743899] [2025-03-04 01:43:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:50,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:43:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:50,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:43:50,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:43:50,241 INFO L87 Difference]: Start difference. First operand 755 states and 970 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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:43:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:51,139 INFO L93 Difference]: Finished difference Result 1666 states and 2134 transitions. [2025-03-04 01:43:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:43:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:51,144 INFO L225 Difference]: With dead ends: 1666 [2025-03-04 01:43:51,144 INFO L226 Difference]: Without dead ends: 935 [2025-03-04 01:43:51,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:43:51,146 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 105 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:51,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1340 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:43:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-04 01:43:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 755. [2025-03-04 01:43:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 627 states have (on average 1.2216905901116428) internal successors, (766), 636 states have internal predecessors, (766), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 970 transitions. [2025-03-04 01:43:51,182 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 970 transitions. Word has length 150 [2025-03-04 01:43:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:51,182 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 970 transitions. [2025-03-04 01:43:51,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 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:43:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 970 transitions. [2025-03-04 01:43:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:51,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:51,183 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:43:51,183 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash 297516278, now seen corresponding path program 1 times [2025-03-04 01:43:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200241411] [2025-03-04 01:43:51,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:52,088 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:43:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200241411] [2025-03-04 01:43:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200241411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:43:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001583330] [2025-03-04 01:43:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:52,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:43:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:52,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:43:52,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:43:52,089 INFO L87 Difference]: Start difference. First operand 755 states and 970 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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:43:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:52,663 INFO L93 Difference]: Finished difference Result 1487 states and 1912 transitions. [2025-03-04 01:43:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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 150 [2025-03-04 01:43:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:52,667 INFO L225 Difference]: With dead ends: 1487 [2025-03-04 01:43:52,667 INFO L226 Difference]: Without dead ends: 756 [2025-03-04 01:43:52,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:43:52,669 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 54 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:52,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1313 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-04 01:43:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 753. [2025-03-04 01:43:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 625 states have (on average 1.2208) internal successors, (763), 634 states have internal predecessors, (763), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 967 transitions. [2025-03-04 01:43:52,703 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 967 transitions. Word has length 150 [2025-03-04 01:43:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:52,703 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 967 transitions. [2025-03-04 01:43:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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:43:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 967 transitions. [2025-03-04 01:43:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:43:52,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:52,704 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:43:52,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:43:52,704 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:52,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1810200001, now seen corresponding path program 1 times [2025-03-04 01:43:52,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380731175] [2025-03-04 01:43:52,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:43:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:43:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:54,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:43:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380731175] [2025-03-04 01:43:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380731175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:43:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174357771] [2025-03-04 01:43:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:43:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:43:54,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:43:54,266 INFO L87 Difference]: Start difference. First operand 753 states and 967 transitions. Second operand has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 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:43:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:54,839 INFO L93 Difference]: Finished difference Result 1557 states and 1998 transitions. [2025-03-04 01:43:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 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 151 [2025-03-04 01:43:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:54,846 INFO L225 Difference]: With dead ends: 1557 [2025-03-04 01:43:54,849 INFO L226 Difference]: Without dead ends: 828 [2025-03-04 01:43:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:43:54,852 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 53 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:54,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 982 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-04 01:43:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 739. [2025-03-04 01:43:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 611 states have (on average 1.2160392798690671) internal successors, (743), 620 states have internal predecessors, (743), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:43:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2025-03-04 01:43:54,897 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 151 [2025-03-04 01:43:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2025-03-04 01:43:54,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.555555555555555) internal successors, (59), 12 states have internal predecessors, (59), 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:43:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2025-03-04 01:43:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:43:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:54,898 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:43:54,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:43:54,899 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash 770630599, now seen corresponding path program 1 times [2025-03-04 01:43:54,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723712115] [2025-03-04 01:43:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:54,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:43:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:43:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:55,299 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:43:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723712115] [2025-03-04 01:43:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723712115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023274221] [2025-03-04 01:43:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:55,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:55,300 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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:43:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:55,670 INFO L93 Difference]: Finished difference Result 1466 states and 1875 transitions. [2025-03-04 01:43:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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 151 [2025-03-04 01:43:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:55,673 INFO L225 Difference]: With dead ends: 1466 [2025-03-04 01:43:55,673 INFO L226 Difference]: Without dead ends: 751 [2025-03-04 01:43:55,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:55,675 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 150 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:55,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 518 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-04 01:43:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 517. [2025-03-04 01:43:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 444 states have (on average 1.2252252252252251) internal successors, (544), 449 states have internal predecessors, (544), 57 states have call successors, (57), 15 states have call predecessors, (57), 15 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 01:43:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 658 transitions. [2025-03-04 01:43:55,702 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 658 transitions. Word has length 151 [2025-03-04 01:43:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:55,702 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 658 transitions. [2025-03-04 01:43:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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:43:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 658 transitions. [2025-03-04 01:43:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:43:55,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:55,703 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:43:55,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:43:55,703 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1042797516, now seen corresponding path program 1 times [2025-03-04 01:43:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814385206] [2025-03-04 01:43:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:55,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:55,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:43:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:43:55,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:55,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:55,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:43:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:55,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814385206] [2025-03-04 01:43:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814385206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:55,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880430896] [2025-03-04 01:43:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:55,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:55,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:55,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:55,812 INFO L87 Difference]: Start difference. First operand 517 states and 658 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:43:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:55,981 INFO L93 Difference]: Finished difference Result 1133 states and 1437 transitions. [2025-03-04 01:43:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:43:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:55,985 INFO L225 Difference]: With dead ends: 1133 [2025-03-04 01:43:55,985 INFO L226 Difference]: Without dead ends: 640 [2025-03-04 01:43:55,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:55,986 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:55,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 403 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:43:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-04 01:43:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 578. [2025-03-04 01:43:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 494 states have (on average 1.214574898785425) internal successors, (600), 500 states have internal predecessors, (600), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 01:43:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 730 transitions. [2025-03-04 01:43:56,017 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 730 transitions. Word has length 151 [2025-03-04 01:43:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:56,017 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 730 transitions. [2025-03-04 01:43:56,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:43:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 730 transitions. [2025-03-04 01:43:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:43:56,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:56,018 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:43:56,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:43:56,018 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:56,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1254148429, now seen corresponding path program 1 times [2025-03-04 01:43:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090366674] [2025-03-04 01:43:56,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:56,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:56,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:43:56,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:43:56,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:56,388 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:43:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090366674] [2025-03-04 01:43:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090366674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685801721] [2025-03-04 01:43:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:56,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:56,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:56,390 INFO L87 Difference]: Start difference. First operand 578 states and 730 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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:43:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:56,724 INFO L93 Difference]: Finished difference Result 1315 states and 1664 transitions. [2025-03-04 01:43:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:43:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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 151 [2025-03-04 01:43:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:56,728 INFO L225 Difference]: With dead ends: 1315 [2025-03-04 01:43:56,728 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 01:43:56,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:56,729 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 93 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:56,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 579 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 01:43:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 571. [2025-03-04 01:43:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 487 states have (on average 1.2094455852156059) internal successors, (589), 493 states have internal predecessors, (589), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 01:43:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 719 transitions. [2025-03-04 01:43:56,760 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 719 transitions. Word has length 151 [2025-03-04 01:43:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:56,760 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 719 transitions. [2025-03-04 01:43:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 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:43:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 719 transitions. [2025-03-04 01:43:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:43:56,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:56,761 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:43:56,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:43:56,761 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:56,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash 492224877, now seen corresponding path program 1 times [2025-03-04 01:43:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965228585] [2025-03-04 01:43:56,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:43:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:43:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:57,320 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:43:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965228585] [2025-03-04 01:43:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965228585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:43:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315947579] [2025-03-04 01:43:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:57,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:43:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:57,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:43:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:57,321 INFO L87 Difference]: Start difference. First operand 571 states and 719 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:43:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:57,826 INFO L93 Difference]: Finished difference Result 1219 states and 1528 transitions. [2025-03-04 01:43:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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 152 [2025-03-04 01:43:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:57,829 INFO L225 Difference]: With dead ends: 1219 [2025-03-04 01:43:57,829 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 01:43:57,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:43:57,830 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:57,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 908 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 01:43:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 571. [2025-03-04 01:43:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 487 states have (on average 1.2053388090349075) internal successors, (587), 493 states have internal predecessors, (587), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 01:43:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 717 transitions. [2025-03-04 01:43:57,860 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 717 transitions. Word has length 152 [2025-03-04 01:43:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 717 transitions. [2025-03-04 01:43:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 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:43:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 717 transitions. [2025-03-04 01:43:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:43:57,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:57,861 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:43:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:43:57,861 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1999776686, now seen corresponding path program 1 times [2025-03-04 01:43:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119289061] [2025-03-04 01:43:57,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:57,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:43:57,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:43:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:58,094 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:43:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119289061] [2025-03-04 01:43:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119289061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:43:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215287795] [2025-03-04 01:43:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:58,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:43:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:58,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:43:58,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:43:58,096 INFO L87 Difference]: Start difference. First operand 571 states and 717 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:58,424 INFO L93 Difference]: Finished difference Result 1308 states and 1649 transitions. [2025-03-04 01:43:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:43:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:43:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:58,428 INFO L225 Difference]: With dead ends: 1308 [2025-03-04 01:43:58,428 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 01:43:58,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:43:58,429 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 120 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:58,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1686 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 01:43:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 599. [2025-03-04 01:43:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 515 states have (on average 1.2077669902912622) internal successors, (622), 521 states have internal predecessors, (622), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 01:43:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 752 transitions. [2025-03-04 01:43:58,461 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 752 transitions. Word has length 152 [2025-03-04 01:43:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:58,461 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 752 transitions. [2025-03-04 01:43:58,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:43:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 752 transitions. [2025-03-04 01:43:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:43:58,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:58,462 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:43:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:43:58,462 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1393233838, now seen corresponding path program 1 times [2025-03-04 01:43:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211989279] [2025-03-04 01:43:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:58,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:43:58,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:43:58,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:58,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:59,360 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:43:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211989279] [2025-03-04 01:43:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211989279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:43:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236195482] [2025-03-04 01:43:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:59,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:43:59,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:43:59,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:43:59,361 INFO L87 Difference]: Start difference. First operand 599 states and 752 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 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:43:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:59,905 INFO L93 Difference]: Finished difference Result 1229 states and 1542 transitions. [2025-03-04 01:43:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:43:59,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 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 152 [2025-03-04 01:43:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:59,908 INFO L225 Difference]: With dead ends: 1229 [2025-03-04 01:43:59,908 INFO L226 Difference]: Without dead ends: 654 [2025-03-04 01:43:59,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:43:59,909 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 63 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:59,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1257 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:43:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-04 01:43:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 599. [2025-03-04 01:43:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 515 states have (on average 1.2077669902912622) internal successors, (622), 521 states have internal predecessors, (622), 65 states have call successors, (65), 18 states have call predecessors, (65), 18 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 01:43:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 752 transitions. [2025-03-04 01:43:59,939 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 752 transitions. Word has length 152 [2025-03-04 01:43:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:59,940 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 752 transitions. [2025-03-04 01:43:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 14 states have internal predecessors, (60), 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:43:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 752 transitions. [2025-03-04 01:43:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:43:59,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:59,941 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:43:59,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:43:59,941 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1394181649, now seen corresponding path program 1 times [2025-03-04 01:43:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882175087] [2025-03-04 01:43:59,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:59,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:43:59,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:43:59,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:59,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:00,136 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:44:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882175087] [2025-03-04 01:44:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882175087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:44:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654352522] [2025-03-04 01:44:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:00,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:44:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:00,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:44:00,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:00,137 INFO L87 Difference]: Start difference. First operand 599 states and 752 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:00,447 INFO L93 Difference]: Finished difference Result 1588 states and 1980 transitions. [2025-03-04 01:44:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:44:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:44:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:00,451 INFO L225 Difference]: With dead ends: 1588 [2025-03-04 01:44:00,451 INFO L226 Difference]: Without dead ends: 1013 [2025-03-04 01:44:00,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:00,454 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:00,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 628 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-04 01:44:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 670. [2025-03-04 01:44:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 583 states have (on average 1.2109777015437393) internal successors, (706), 590 states have internal predecessors, (706), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 01:44:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2025-03-04 01:44:00,491 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 152 [2025-03-04 01:44:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:00,492 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2025-03-04 01:44:00,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2025-03-04 01:44:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:00,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:00,493 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:44:00,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:44:00,493 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:00,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 643874640, now seen corresponding path program 1 times [2025-03-04 01:44:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548378215] [2025-03-04 01:44:00,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:00,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:00,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:00,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:00,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:00,696 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:44:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:00,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548378215] [2025-03-04 01:44:00,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548378215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:00,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:00,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:00,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338159179] [2025-03-04 01:44:00,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:00,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:00,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:00,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:00,697 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:44:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:01,031 INFO L93 Difference]: Finished difference Result 1710 states and 2116 transitions. [2025-03-04 01:44:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:44:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:44:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:01,035 INFO L225 Difference]: With dead ends: 1710 [2025-03-04 01:44:01,035 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 01:44:01,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:01,037 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 112 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:01,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 798 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 01:44:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 670. [2025-03-04 01:44:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 583 states have (on average 1.2109777015437393) internal successors, (706), 590 states have internal predecessors, (706), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 01:44:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2025-03-04 01:44:01,077 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 152 [2025-03-04 01:44:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:01,077 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2025-03-04 01:44:01,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:44:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2025-03-04 01:44:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:01,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:01,078 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:44:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:44:01,078 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1138497293, now seen corresponding path program 1 times [2025-03-04 01:44:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625395798] [2025-03-04 01:44:01,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:01,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:01,212 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:44:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625395798] [2025-03-04 01:44:01,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625395798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:01,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:01,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351233236] [2025-03-04 01:44:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:01,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:01,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:01,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:01,214 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:01,420 INFO L93 Difference]: Finished difference Result 1323 states and 1653 transitions. [2025-03-04 01:44:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:44:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:01,424 INFO L225 Difference]: With dead ends: 1323 [2025-03-04 01:44:01,424 INFO L226 Difference]: Without dead ends: 677 [2025-03-04 01:44:01,424 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:44:01,425 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:01,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-04 01:44:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 628. [2025-03-04 01:44:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 541 states have (on average 1.201478743068392) internal successors, (650), 548 states have internal predecessors, (650), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 01:44:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 784 transitions. [2025-03-04 01:44:01,459 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 784 transitions. Word has length 152 [2025-03-04 01:44:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:01,459 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 784 transitions. [2025-03-04 01:44:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 784 transitions. [2025-03-04 01:44:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:01,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:01,460 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:01,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:44:01,460 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1427198590, now seen corresponding path program 1 times [2025-03-04 01:44:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900265601] [2025-03-04 01:44:01,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:01,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:01,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:01,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:01,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:02,083 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:44:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900265601] [2025-03-04 01:44:02,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900265601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:02,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:02,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:44:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071893831] [2025-03-04 01:44:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:44:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:02,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:44:02,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:02,084 INFO L87 Difference]: Start difference. First operand 628 states and 784 transitions. Second operand has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 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:44:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:02,329 INFO L93 Difference]: Finished difference Result 1567 states and 1942 transitions. [2025-03-04 01:44:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:44:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 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 152 [2025-03-04 01:44:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:02,333 INFO L225 Difference]: With dead ends: 1567 [2025-03-04 01:44:02,333 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 01:44:02,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:44:02,334 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 50 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:02,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 503 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 01:44:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 809. [2025-03-04 01:44:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 722 states have (on average 1.1869806094182827) internal successors, (857), 729 states have internal predecessors, (857), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 60 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 01:44:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 991 transitions. [2025-03-04 01:44:02,374 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 991 transitions. Word has length 152 [2025-03-04 01:44:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:02,374 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 991 transitions. [2025-03-04 01:44:02,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 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:44:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 991 transitions. [2025-03-04 01:44:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:02,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:02,375 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:44:02,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:44:02,375 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:02,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -369752769, now seen corresponding path program 1 times [2025-03-04 01:44:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054231255] [2025-03-04 01:44:02,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:02,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:03,132 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:44:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054231255] [2025-03-04 01:44:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054231255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759647679] [2025-03-04 01:44:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:03,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:03,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:03,133 INFO L87 Difference]: Start difference. First operand 809 states and 991 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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:44:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:03,368 INFO L93 Difference]: Finished difference Result 836 states and 1023 transitions. [2025-03-04 01:44:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:44:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 152 [2025-03-04 01:44:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:03,371 INFO L225 Difference]: With dead ends: 836 [2025-03-04 01:44:03,371 INFO L226 Difference]: Without dead ends: 834 [2025-03-04 01:44:03,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:03,372 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 47 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:03,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 627 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:44:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-04 01:44:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 773. [2025-03-04 01:44:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 696 states have (on average 1.1853448275862069) internal successors, (825), 701 states have internal predecessors, (825), 59 states have call successors, (59), 17 states have call predecessors, (59), 17 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 01:44:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 943 transitions. [2025-03-04 01:44:03,439 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 943 transitions. Word has length 152 [2025-03-04 01:44:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:03,439 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 943 transitions. [2025-03-04 01:44:03,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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:44:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 943 transitions. [2025-03-04 01:44:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:03,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:03,440 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:44:03,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 01:44:03,440 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -368829248, now seen corresponding path program 1 times [2025-03-04 01:44:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500987226] [2025-03-04 01:44:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:03,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:03,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:03,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:03,595 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:44:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:03,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500987226] [2025-03-04 01:44:03,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500987226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:03,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:03,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773116245] [2025-03-04 01:44:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:03,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:03,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:03,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:03,596 INFO L87 Difference]: Start difference. First operand 773 states and 943 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:03,743 INFO L93 Difference]: Finished difference Result 1599 states and 1951 transitions. [2025-03-04 01:44:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:03,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:44:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:03,745 INFO L225 Difference]: With dead ends: 1599 [2025-03-04 01:44:03,745 INFO L226 Difference]: Without dead ends: 829 [2025-03-04 01:44:03,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:03,747 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 85 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:03,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 500 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:44:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-04 01:44:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 828. [2025-03-04 01:44:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 729 states have (on average 1.168724279835391) internal successors, (852), 735 states have internal predecessors, (852), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 01:44:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1004 transitions. [2025-03-04 01:44:03,804 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1004 transitions. Word has length 152 [2025-03-04 01:44:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1004 transitions. [2025-03-04 01:44:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1004 transitions. [2025-03-04 01:44:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:44:03,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:03,805 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:44:03,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 01:44:03,805 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 518674433, now seen corresponding path program 1 times [2025-03-04 01:44:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060541035] [2025-03-04 01:44:03,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:03,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:03,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:44:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060541035] [2025-03-04 01:44:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060541035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44312362] [2025-03-04 01:44:03,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:03,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:03,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:03,901 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:44:03,901 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:44:04,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:44:04,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:44:04,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:04,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:04,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:04,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:04,103 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:44:04,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44312362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:44:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119080833] [2025-03-04 01:44:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:04,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:04,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:04,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:04,106 INFO L87 Difference]: Start difference. First operand 828 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:04,175 INFO L93 Difference]: Finished difference Result 1620 states and 1965 transitions. [2025-03-04 01:44:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:44:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:04,178 INFO L225 Difference]: With dead ends: 1620 [2025-03-04 01:44:04,178 INFO L226 Difference]: Without dead ends: 846 [2025-03-04 01:44:04,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:04,180 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:04,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-04 01:44:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2025-03-04 01:44:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 747 states have (on average 1.1646586345381527) internal successors, (870), 753 states have internal predecessors, (870), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 01:44:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1022 transitions. [2025-03-04 01:44:04,230 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1022 transitions. Word has length 152 [2025-03-04 01:44:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:04,231 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1022 transitions. [2025-03-04 01:44:04,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:44:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1022 transitions. [2025-03-04 01:44:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:44:04,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:04,232 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:44:04,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:44:04,432 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,SelfDestructingSolverStorable44 [2025-03-04 01:44:04,433 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -531776574, now seen corresponding path program 1 times [2025-03-04 01:44:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131616642] [2025-03-04 01:44:04,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:44:04,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:44:04,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:04,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:04,628 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:44:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131616642] [2025-03-04 01:44:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131616642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075654477] [2025-03-04 01:44:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:04,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:04,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:04,629 INFO L87 Difference]: Start difference. First operand 846 states and 1022 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:44:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:04,845 INFO L93 Difference]: Finished difference Result 1706 states and 2050 transitions. [2025-03-04 01:44:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:04,846 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:44:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:04,849 INFO L225 Difference]: With dead ends: 1706 [2025-03-04 01:44:04,849 INFO L226 Difference]: Without dead ends: 914 [2025-03-04 01:44:04,850 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:44:04,850 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 44 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 502 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-04 01:44:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 826. [2025-03-04 01:44:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 727 states have (on average 1.1636863823933976) internal successors, (846), 733 states have internal predecessors, (846), 76 states have call successors, (76), 22 states have call predecessors, (76), 22 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 01:44:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 998 transitions. [2025-03-04 01:44:04,897 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 998 transitions. Word has length 153 [2025-03-04 01:44:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:04,897 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 998 transitions. [2025-03-04 01:44:04,897 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:44:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 998 transitions. [2025-03-04 01:44:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:44:04,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:04,898 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:44:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 01:44:04,899 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1249063754, now seen corresponding path program 1 times [2025-03-04 01:44:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558440115] [2025-03-04 01:44:04,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:04,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:44:04,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:44:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:44:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558440115] [2025-03-04 01:44:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558440115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62183886] [2025-03-04 01:44:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:05,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:05,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:05,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:05,577 INFO L87 Difference]: Start difference. First operand 826 states and 998 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 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:44:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:06,073 INFO L93 Difference]: Finished difference Result 1771 states and 2136 transitions. [2025-03-04 01:44:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 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:44:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:06,077 INFO L225 Difference]: With dead ends: 1771 [2025-03-04 01:44:06,077 INFO L226 Difference]: Without dead ends: 999 [2025-03-04 01:44:06,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:44:06,078 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 63 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:06,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1215 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-04 01:44:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 882. [2025-03-04 01:44:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 766 states have (on average 1.1579634464751958) internal successors, (887), 774 states have internal predecessors, (887), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:44:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1063 transitions. [2025-03-04 01:44:06,138 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1063 transitions. Word has length 153 [2025-03-04 01:44:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1063 transitions. [2025-03-04 01:44:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 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:44:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1063 transitions. [2025-03-04 01:44:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:44:06,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:06,140 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:44:06,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 01:44:06,140 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 480601571, now seen corresponding path program 1 times [2025-03-04 01:44:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076598868] [2025-03-04 01:44:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:44:06,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:44:06,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:06,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:06,784 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:44:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076598868] [2025-03-04 01:44:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076598868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678198200] [2025-03-04 01:44:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:06,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:06,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:06,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:06,785 INFO L87 Difference]: Start difference. First operand 882 states and 1063 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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:44:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:07,164 INFO L93 Difference]: Finished difference Result 2084 states and 2459 transitions. [2025-03-04 01:44:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:44:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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 154 [2025-03-04 01:44:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:07,167 INFO L225 Difference]: With dead ends: 2084 [2025-03-04 01:44:07,167 INFO L226 Difference]: Without dead ends: 1256 [2025-03-04 01:44:07,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:07,169 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 42 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:07,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 619 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-04 01:44:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1170. [2025-03-04 01:44:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1024 states have (on average 1.1201171875) internal successors, (1147), 1037 states have internal predecessors, (1147), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:44:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1363 transitions. [2025-03-04 01:44:07,259 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1363 transitions. Word has length 154 [2025-03-04 01:44:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:07,259 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1363 transitions. [2025-03-04 01:44:07,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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:44:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1363 transitions. [2025-03-04 01:44:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:44:07,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:07,260 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:44:07,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 01:44:07,261 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:07,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1028741123, now seen corresponding path program 1 times [2025-03-04 01:44:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321699491] [2025-03-04 01:44:07,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:07,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:44:07,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:44:07,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:07,432 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:44:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:07,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321699491] [2025-03-04 01:44:07,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321699491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:07,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:07,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:44:07,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986900496] [2025-03-04 01:44:07,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:07,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:44:07,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:07,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:44:07,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:07,433 INFO L87 Difference]: Start difference. First operand 1170 states and 1363 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:44:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:07,774 INFO L93 Difference]: Finished difference Result 2686 states and 3116 transitions. [2025-03-04 01:44:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:44:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:44:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:07,778 INFO L225 Difference]: With dead ends: 2686 [2025-03-04 01:44:07,778 INFO L226 Difference]: Without dead ends: 1570 [2025-03-04 01:44:07,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:07,780 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 51 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:07,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 629 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-04 01:44:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1325. [2025-03-04 01:44:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1179 states have (on average 1.112807463952502) internal successors, (1312), 1192 states have internal predecessors, (1312), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:44:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1528 transitions. [2025-03-04 01:44:07,872 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1528 transitions. Word has length 154 [2025-03-04 01:44:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:07,872 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1528 transitions. [2025-03-04 01:44:07,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:44:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1528 transitions. [2025-03-04 01:44:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:44:07,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:07,874 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:44:07,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 01:44:07,874 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 735338116, now seen corresponding path program 1 times [2025-03-04 01:44:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483498962] [2025-03-04 01:44:07,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:07,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:44:07,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:44:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:08,851 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:44:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483498962] [2025-03-04 01:44:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483498962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:44:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153825513] [2025-03-04 01:44:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:44:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:44:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:08,853 INFO L87 Difference]: Start difference. First operand 1325 states and 1528 transitions. Second operand has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 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:44:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:09,478 INFO L93 Difference]: Finished difference Result 2823 states and 3240 transitions. [2025-03-04 01:44:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 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 154 [2025-03-04 01:44:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:09,482 INFO L225 Difference]: With dead ends: 2823 [2025-03-04 01:44:09,482 INFO L226 Difference]: Without dead ends: 1552 [2025-03-04 01:44:09,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:09,484 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 42 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:09,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 935 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-04 01:44:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1320. [2025-03-04 01:44:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1174 states have (on average 1.1132879045996593) internal successors, (1307), 1187 states have internal predecessors, (1307), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:44:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1523 transitions. [2025-03-04 01:44:09,585 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1523 transitions. Word has length 154 [2025-03-04 01:44:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:09,585 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1523 transitions. [2025-03-04 01:44:09,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 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:44:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1523 transitions. [2025-03-04 01:44:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:44:09,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:09,586 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:44:09,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 01:44:09,587 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 621765285, now seen corresponding path program 1 times [2025-03-04 01:44:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448967168] [2025-03-04 01:44:09,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:09,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:44:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:44:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:09,806 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:44:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448967168] [2025-03-04 01:44:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448967168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:44:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450815695] [2025-03-04 01:44:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:44:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:09,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:44:09,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:09,808 INFO L87 Difference]: Start difference. First operand 1320 states and 1523 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:44:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:10,225 INFO L93 Difference]: Finished difference Result 3842 states and 4426 transitions. [2025-03-04 01:44:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:10,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:44:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:10,229 INFO L225 Difference]: With dead ends: 3842 [2025-03-04 01:44:10,230 INFO L226 Difference]: Without dead ends: 1352 [2025-03-04 01:44:10,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:10,232 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 103 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:10,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1049 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-04 01:44:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1328. [2025-03-04 01:44:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1182 states have (on average 1.0905245346869712) internal successors, (1289), 1195 states have internal predecessors, (1289), 108 states have call successors, (108), 37 states have call predecessors, (108), 37 states have return successors, (108), 95 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:44:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1505 transitions. [2025-03-04 01:44:10,332 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1505 transitions. Word has length 155 [2025-03-04 01:44:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:10,333 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1505 transitions. [2025-03-04 01:44:10,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:44:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1505 transitions. [2025-03-04 01:44:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:44:10,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:10,335 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:44:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-04 01:44:10,335 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1583379302, now seen corresponding path program 1 times [2025-03-04 01:44:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369966432] [2025-03-04 01:44:10,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:10,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:44:10,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:44:10,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:10,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047379226] [2025-03-04 01:44:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:10,454 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:44:10,456 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:44:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:44:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:44:10,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:10,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:10,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 01:44:10,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:10,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:44:10,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:44:10,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2025-03-04 01:44:11,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 38 [2025-03-04 01:44:11,136 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:44:11,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369966432] [2025-03-04 01:44:11,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:44:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047379226] [2025-03-04 01:44:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047379226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263253444] [2025-03-04 01:44:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:11,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:11,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:11,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:11,138 INFO L87 Difference]: Start difference. First operand 1328 states and 1505 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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:44:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:12,457 INFO L93 Difference]: Finished difference Result 2585 states and 2914 transitions. [2025-03-04 01:44:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:44:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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:44:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:12,460 INFO L225 Difference]: With dead ends: 2585 [2025-03-04 01:44:12,460 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:44:12,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:12,464 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 91 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:12,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 498 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:44:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:44:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:44:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:44:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:44:12,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2025-03-04 01:44:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:44:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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:44:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:44:12,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:44:12,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:44:12,478 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:44:12,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:12,672 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:12,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.