./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.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-32.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 a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:38:11,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:38:11,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:38:11,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:38:11,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:38:11,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:38:11,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:38:11,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:38:11,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:38:11,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:38:11,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:38:11,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:38:11,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:38:11,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:38:11,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:38:11,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:38:11,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:38:11,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:11,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:38:11,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:38:11,554 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 -> a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 [2025-03-04 01:38:11,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:38:11,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:38:11,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:38:11,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:38:11,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:38:11,779 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-32.i [2025-03-04 01:38:12,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17267ae53/3775ed8023e44669a22b7e63c2750a91/FLAGc3031864e [2025-03-04 01:38:13,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:38:13,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.i [2025-03-04 01:38:13,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17267ae53/3775ed8023e44669a22b7e63c2750a91/FLAGc3031864e [2025-03-04 01:38:13,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17267ae53/3775ed8023e44669a22b7e63c2750a91 [2025-03-04 01:38:13,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:38:13,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:38:13,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:13,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:38:13,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:38:13,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95615a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13, skipping insertion in model container [2025-03-04 01:38:13,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:38:13,588 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-32.i[916,929] [2025-03-04 01:38:13,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:13,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:38:13,635 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-32.i[916,929] [2025-03-04 01:38:13,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:13,689 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:38:13,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13 WrapperNode [2025-03-04 01:38:13,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:13,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:13,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:38:13,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:38:13,695 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:38:13" (1/1) ... [2025-03-04 01:38:13,703 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:38:13" (1/1) ... [2025-03-04 01:38:13,731 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-04 01:38:13,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:13,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:38:13,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:38:13,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:38:13,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,753 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-03-04 01:38:13,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:38:13,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:38:13,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:38:13,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:38:13,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (1/1) ... [2025-03-04 01:38:13,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:13,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:13,807 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:38:13,809 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:38:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:38:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:38:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:38:13,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:38:13,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:38:13,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:38:14,213 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-03-04 01:38:14,243 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:38:14,243 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:38:14,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:38:14,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:38:14,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:14 BoogieIcfgContainer [2025-03-04 01:38:14,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:38:14,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:38:14,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:38:14,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:38:14,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:38:13" (1/3) ... [2025-03-04 01:38:14,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64adfaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:14, skipping insertion in model container [2025-03-04 01:38:14,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:13" (2/3) ... [2025-03-04 01:38:14,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64adfaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:14, skipping insertion in model container [2025-03-04 01:38:14,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:14" (3/3) ... [2025-03-04 01:38:14,263 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-32.i [2025-03-04 01:38:14,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:38:14,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:38:14,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:38:14,315 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;@6589cd2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:38:14,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:38:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:38:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:38:14,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:14,326 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1311769662, now seen corresponding path program 1 times [2025-03-04 01:38:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:14,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121574381] [2025-03-04 01:38:14,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:14,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:14,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:38:14,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:38:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:38:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121574381] [2025-03-04 01:38:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121574381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:38:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026735041] [2025-03-04 01:38:14,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:38:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:14,575 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:38:14,576 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:38:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:38:14,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:38:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:14,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:38:14,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:38:14,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026735041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:38:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:38:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591051783] [2025-03-04 01:38:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:14,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:38:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:14,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:38:14,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:38:14,760 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:14,781 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-04 01:38:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:38:14,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-04 01:38:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:14,786 INFO L225 Difference]: With dead ends: 190 [2025-03-04 01:38:14,786 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:38:14,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:38:14,790 INFO L435 NwaCegarLoop]: 132 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, 132 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:38:14,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:38:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:38:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:38:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-04 01:38:14,815 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-03-04 01:38:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-04 01:38:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-04 01:38:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:38:14,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:14,818 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,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:38:15,018 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:38:15,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 786408876, now seen corresponding path program 1 times [2025-03-04 01:38:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556292134] [2025-03-04 01:38:15,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:15,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:38:15,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:38:15,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:15,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556292134] [2025-03-04 01:38:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556292134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:15,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:38:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469282640] [2025-03-04 01:38:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:15,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:38:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:15,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:38:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:38:15,587 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:15,845 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-03-04 01:38:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:38:15,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-04 01:38:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:15,849 INFO L225 Difference]: With dead ends: 318 [2025-03-04 01:38:15,849 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 01:38:15,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:15,850 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 200 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:15,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 271 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 01:38:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-03-04 01:38:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:38:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-03-04 01:38:15,876 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-03-04 01:38:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:15,876 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-03-04 01:38:15,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-03-04 01:38:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:38:15,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:15,878 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:38:15,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash -153570148, now seen corresponding path program 1 times [2025-03-04 01:38:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712744861] [2025-03-04 01:38:15,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:15,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:38:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:38:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712744861] [2025-03-04 01:38:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712744861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:17,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:38:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503941158] [2025-03-04 01:38:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:38:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:38:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:38:17,279 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:17,810 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2025-03-04 01:38:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:38:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-04 01:38:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:17,813 INFO L225 Difference]: With dead ends: 511 [2025-03-04 01:38:17,814 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 01:38:17,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:38:17,816 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 869 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:38:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 01:38:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2025-03-04 01:38:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:38:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 441 transitions. [2025-03-04 01:38:17,843 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 441 transitions. Word has length 137 [2025-03-04 01:38:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:17,844 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 441 transitions. [2025-03-04 01:38:17,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 441 transitions. [2025-03-04 01:38:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:38:17,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:17,845 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:38:17,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:17,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800959, now seen corresponding path program 1 times [2025-03-04 01:38:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:17,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778715234] [2025-03-04 01:38:17,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:17,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:38:17,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:38:17,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778715234] [2025-03-04 01:38:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778715234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:38:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977660879] [2025-03-04 01:38:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:38:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:38:19,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:38:19,547 INFO L87 Difference]: Start difference. First operand 317 states and 441 transitions. Second operand has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:20,360 INFO L93 Difference]: Finished difference Result 683 states and 951 transitions. [2025-03-04 01:38:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:38:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-04 01:38:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:20,364 INFO L225 Difference]: With dead ends: 683 [2025-03-04 01:38:20,364 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 01:38:20,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:38:20,365 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:20,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1085 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:38:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 01:38:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 332. [2025-03-04 01:38:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.325088339222615) internal successors, (375), 285 states have internal predecessors, (375), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:38:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2025-03-04 01:38:20,386 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 139 [2025-03-04 01:38:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:20,387 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2025-03-04 01:38:20,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2025-03-04 01:38:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:38:20,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:20,388 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:20,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:38:20,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:20,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -545676001, now seen corresponding path program 1 times [2025-03-04 01:38:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964948193] [2025-03-04 01:38:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:20,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:38:20,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:38:20,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:20,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964948193] [2025-03-04 01:38:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964948193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:38:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149579899] [2025-03-04 01:38:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:38:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:21,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:38:21,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:38:21,877 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:22,592 INFO L93 Difference]: Finished difference Result 655 states and 914 transitions. [2025-03-04 01:38:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:38:22,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-03-04 01:38:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:22,595 INFO L225 Difference]: With dead ends: 655 [2025-03-04 01:38:22,597 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 01:38:22,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:38:22,600 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:22,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 857 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:38:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 01:38:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2025-03-04 01:38:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.3223443223443223) internal successors, (361), 275 states have internal predecessors, (361), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:38:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2025-03-04 01:38:22,624 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 139 [2025-03-04 01:38:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2025-03-04 01:38:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2025-03-04 01:38:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:38:22,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:22,629 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:38:22,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 981150675, now seen corresponding path program 1 times [2025-03-04 01:38:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465859859] [2025-03-04 01:38:22,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:22,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:38:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:38:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:22,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:38:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465859859] [2025-03-04 01:38:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465859859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:38:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917359392] [2025-03-04 01:38:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:22,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:38:22,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:22,738 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:38:22,739 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:38:22,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:38:22,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:38:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:22,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:22,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:38:22,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:22,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917359392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:38:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:38:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690359789] [2025-03-04 01:38:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:38:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:22,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:38:22,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:38:22,895 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:22,927 INFO L93 Difference]: Finished difference Result 653 states and 911 transitions. [2025-03-04 01:38:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-03-04 01:38:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:22,931 INFO L225 Difference]: With dead ends: 653 [2025-03-04 01:38:22,931 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:38:22,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 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:38:22,932 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 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:38:22,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:38:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-04 01:38:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 285 states have (on average 1.3087719298245615) internal successors, (373), 287 states have internal predecessors, (373), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:38:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 461 transitions. [2025-03-04 01:38:22,951 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 461 transitions. Word has length 139 [2025-03-04 01:38:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:22,951 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 461 transitions. [2025-03-04 01:38:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 461 transitions. [2025-03-04 01:38:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:38:22,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:22,953 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,959 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:38:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 01:38:23,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:23,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1788128770, now seen corresponding path program 1 times [2025-03-04 01:38:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105196519] [2025-03-04 01:38:23,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:38:23,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:38:23,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:23,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105196519] [2025-03-04 01:38:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105196519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:38:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634278441] [2025-03-04 01:38:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:38:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:24,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:38:24,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:38:24,311 INFO L87 Difference]: Start difference. First operand 334 states and 461 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:25,186 INFO L93 Difference]: Finished difference Result 787 states and 1078 transitions. [2025-03-04 01:38:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:38:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-03-04 01:38:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:25,189 INFO L225 Difference]: With dead ends: 787 [2025-03-04 01:38:25,189 INFO L226 Difference]: Without dead ends: 456 [2025-03-04 01:38:25,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:38:25,191 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 127 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:25,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1697 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:38:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-04 01:38:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 364. [2025-03-04 01:38:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 315 states have (on average 1.307936507936508) internal successors, (412), 317 states have internal predecessors, (412), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:38:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 500 transitions. [2025-03-04 01:38:25,209 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 500 transitions. Word has length 141 [2025-03-04 01:38:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 500 transitions. [2025-03-04 01:38:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 500 transitions. [2025-03-04 01:38:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:38:25,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:25,210 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:38:25,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 280515349, now seen corresponding path program 1 times [2025-03-04 01:38:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013427432] [2025-03-04 01:38:25,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:38:25,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:38:25,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:25,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013427432] [2025-03-04 01:38:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013427432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:38:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769964862] [2025-03-04 01:38:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:38:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:25,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:38:25,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:38:25,957 INFO L87 Difference]: Start difference. First operand 364 states and 500 transitions. Second operand has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:26,563 INFO L93 Difference]: Finished difference Result 1016 states and 1385 transitions. [2025-03-04 01:38:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:38:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-03-04 01:38:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:26,568 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 01:38:26,568 INFO L226 Difference]: Without dead ends: 655 [2025-03-04 01:38:26,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:38:26,570 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 207 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:26,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 474 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:38:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-04 01:38:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 632. [2025-03-04 01:38:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 529 states have (on average 1.281663516068053) internal successors, (678), 534 states have internal predecessors, (678), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 01:38:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 862 transitions. [2025-03-04 01:38:26,617 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 862 transitions. Word has length 141 [2025-03-04 01:38:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 862 transitions. [2025-03-04 01:38:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 862 transitions. [2025-03-04 01:38:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:38:26,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:26,619 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:38:26,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1747853127, now seen corresponding path program 1 times [2025-03-04 01:38:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711953165] [2025-03-04 01:38:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:26,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:38:26,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:38:26,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:26,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711953165] [2025-03-04 01:38:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711953165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 01:38:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538848102] [2025-03-04 01:38:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:28,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 01:38:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:28,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 01:38:28,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:38:28,527 INFO L87 Difference]: Start difference. First operand 632 states and 862 transitions. Second operand has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:38:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:30,658 INFO L93 Difference]: Finished difference Result 1228 states and 1597 transitions. [2025-03-04 01:38:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 01:38:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) Word has length 141 [2025-03-04 01:38:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:30,666 INFO L225 Difference]: With dead ends: 1228 [2025-03-04 01:38:30,666 INFO L226 Difference]: Without dead ends: 1226 [2025-03-04 01:38:30,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 01:38:30,670 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 633 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:30,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 975 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:38:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-04 01:38:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1051. [2025-03-04 01:38:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 906 states have (on average 1.2516556291390728) internal successors, (1134), 918 states have internal predecessors, (1134), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:38:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1378 transitions. [2025-03-04 01:38:30,748 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1378 transitions. Word has length 141 [2025-03-04 01:38:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1378 transitions. [2025-03-04 01:38:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:38:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1378 transitions. [2025-03-04 01:38:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:38:30,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:30,750 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:30,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:38:30,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1868612061, now seen corresponding path program 1 times [2025-03-04 01:38:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327302921] [2025-03-04 01:38:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:30,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:38:30,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:38:30,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:30,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327302921] [2025-03-04 01:38:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327302921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:31,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:38:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551531355] [2025-03-04 01:38:31,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:31,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:38:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:31,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:38:31,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:38:31,729 INFO L87 Difference]: Start difference. First operand 1051 states and 1378 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:32,332 INFO L93 Difference]: Finished difference Result 2176 states and 2847 transitions. [2025-03-04 01:38:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:38:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 142 [2025-03-04 01:38:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:32,337 INFO L225 Difference]: With dead ends: 2176 [2025-03-04 01:38:32,337 INFO L226 Difference]: Without dead ends: 1133 [2025-03-04 01:38:32,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:38:32,340 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 52 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:32,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1475 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:38:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-04 01:38:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1009. [2025-03-04 01:38:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 864 states have (on average 1.25) internal successors, (1080), 876 states have internal predecessors, (1080), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:38:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1324 transitions. [2025-03-04 01:38:32,381 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1324 transitions. Word has length 142 [2025-03-04 01:38:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1324 transitions. [2025-03-04 01:38:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1324 transitions. [2025-03-04 01:38:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:38:32,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:32,383 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:38:32,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:32,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 801936092, now seen corresponding path program 1 times [2025-03-04 01:38:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071371471] [2025-03-04 01:38:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:32,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:38:32,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:38:32,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:32,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071371471] [2025-03-04 01:38:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071371471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:38:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964494312] [2025-03-04 01:38:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:38:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:38:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:38:32,909 INFO L87 Difference]: Start difference. First operand 1009 states and 1324 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:33,334 INFO L93 Difference]: Finished difference Result 2040 states and 2687 transitions. [2025-03-04 01:38:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:38:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-04 01:38:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:33,342 INFO L225 Difference]: With dead ends: 2040 [2025-03-04 01:38:33,342 INFO L226 Difference]: Without dead ends: 1413 [2025-03-04 01:38:33,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:38:33,345 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:33,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1104 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-04 01:38:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1391. [2025-03-04 01:38:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1204 states have (on average 1.2574750830564785) internal successors, (1514), 1222 states have internal predecessors, (1514), 158 states have call successors, (158), 28 states have call predecessors, (158), 28 states have return successors, (158), 140 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-04 01:38:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1830 transitions. [2025-03-04 01:38:33,397 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1830 transitions. Word has length 142 [2025-03-04 01:38:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:33,398 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1830 transitions. [2025-03-04 01:38:33,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1830 transitions. [2025-03-04 01:38:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:38:33,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:33,400 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:38:33,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash 646521203, now seen corresponding path program 1 times [2025-03-04 01:38:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441596151] [2025-03-04 01:38:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:33,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:38:33,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:38:33,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441596151] [2025-03-04 01:38:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441596151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:33,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435831629] [2025-03-04 01:38:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:33,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:33,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:33,680 INFO L87 Difference]: Start difference. First operand 1391 states and 1830 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:33,931 INFO L93 Difference]: Finished difference Result 3200 states and 4193 transitions. [2025-03-04 01:38:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:33,932 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-03-04 01:38:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:33,938 INFO L225 Difference]: With dead ends: 3200 [2025-03-04 01:38:33,938 INFO L226 Difference]: Without dead ends: 1817 [2025-03-04 01:38:33,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:38:33,941 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:33,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 491 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-04 01:38:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1783. [2025-03-04 01:38:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1528 states have (on average 1.2395287958115184) internal successors, (1894), 1552 states have internal predecessors, (1894), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-04 01:38:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2322 transitions. [2025-03-04 01:38:34,007 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2322 transitions. Word has length 143 [2025-03-04 01:38:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:34,008 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2322 transitions. [2025-03-04 01:38:34,008 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2322 transitions. [2025-03-04 01:38:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:38:34,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:34,009 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:38:34,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1403197884, now seen corresponding path program 1 times [2025-03-04 01:38:34,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785634052] [2025-03-04 01:38:34,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:38:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:38:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785634052] [2025-03-04 01:38:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785634052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:34,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:38:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485106692] [2025-03-04 01:38:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:38:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:34,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:38:34,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:38:34,921 INFO L87 Difference]: Start difference. First operand 1783 states and 2322 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:35,208 INFO L93 Difference]: Finished difference Result 4058 states and 5266 transitions. [2025-03-04 01:38:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:38:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-03-04 01:38:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:35,218 INFO L225 Difference]: With dead ends: 4058 [2025-03-04 01:38:35,218 INFO L226 Difference]: Without dead ends: 2291 [2025-03-04 01:38:35,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:38:35,222 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 35 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:35,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 751 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-03-04 01:38:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2107. [2025-03-04 01:38:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1852 states have (on average 1.232181425485961) internal successors, (2282), 1876 states have internal predecessors, (2282), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-04 01:38:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2710 transitions. [2025-03-04 01:38:35,294 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2710 transitions. Word has length 143 [2025-03-04 01:38:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:35,294 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2710 transitions. [2025-03-04 01:38:35,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2710 transitions. [2025-03-04 01:38:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:38:35,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:35,296 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:38:35,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:35,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1337386401, now seen corresponding path program 1 times [2025-03-04 01:38:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792364846] [2025-03-04 01:38:35,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:38:35,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:38:35,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:35,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792364846] [2025-03-04 01:38:35,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792364846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:35,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:35,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:35,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957813275] [2025-03-04 01:38:35,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:35,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:35,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:35,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:35,717 INFO L87 Difference]: Start difference. First operand 2107 states and 2710 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:36,003 INFO L93 Difference]: Finished difference Result 3551 states and 4578 transitions. [2025-03-04 01:38:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:36,004 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-04 01:38:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:36,010 INFO L225 Difference]: With dead ends: 3551 [2025-03-04 01:38:36,010 INFO L226 Difference]: Without dead ends: 2085 [2025-03-04 01:38:36,012 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:38:36,013 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 66 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:36,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 607 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-04 01:38:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2081. [2025-03-04 01:38:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 1820 states have (on average 1.2247252747252748) internal successors, (2229), 1844 states have internal predecessors, (2229), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-04 01:38:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2665 transitions. [2025-03-04 01:38:36,082 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2665 transitions. Word has length 144 [2025-03-04 01:38:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:36,084 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 2665 transitions. [2025-03-04 01:38:36,084 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2665 transitions. [2025-03-04 01:38:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:38:36,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:36,086 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:38:36,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:36,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:36,087 INFO L85 PathProgramCache]: Analyzing trace with hash 667856171, now seen corresponding path program 1 times [2025-03-04 01:38:36,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:36,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465214432] [2025-03-04 01:38:36,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:36,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:38:36,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:38:36,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:36,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465214432] [2025-03-04 01:38:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465214432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:37,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:37,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:38:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648745211] [2025-03-04 01:38:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:37,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:38:37,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:37,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:38:37,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:38:37,925 INFO L87 Difference]: Start difference. First operand 2081 states and 2665 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:40,117 INFO L93 Difference]: Finished difference Result 4168 states and 5333 transitions. [2025-03-04 01:38:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:38:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-03-04 01:38:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:40,125 INFO L225 Difference]: With dead ends: 4168 [2025-03-04 01:38:40,125 INFO L226 Difference]: Without dead ends: 2103 [2025-03-04 01:38:40,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:38:40,130 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 285 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:40,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1010 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:38:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2025-03-04 01:38:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2068. [2025-03-04 01:38:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1807 states have (on average 1.2257885998893192) internal successors, (2215), 1831 states have internal predecessors, (2215), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-04 01:38:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2651 transitions. [2025-03-04 01:38:40,207 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2651 transitions. Word has length 144 [2025-03-04 01:38:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 2651 transitions. [2025-03-04 01:38:40,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2651 transitions. [2025-03-04 01:38:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:40,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:40,210 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:38:40,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:40,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -378721925, now seen corresponding path program 1 times [2025-03-04 01:38:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168812427] [2025-03-04 01:38:40,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:40,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:40,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:40,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:40,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168812427] [2025-03-04 01:38:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168812427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:38:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099213595] [2025-03-04 01:38:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:38:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:40,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:38:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:38:40,845 INFO L87 Difference]: Start difference. First operand 2068 states and 2651 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:41,183 INFO L93 Difference]: Finished difference Result 4103 states and 5249 transitions. [2025-03-04 01:38:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:38:41,184 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-04 01:38:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:41,190 INFO L225 Difference]: With dead ends: 4103 [2025-03-04 01:38:41,191 INFO L226 Difference]: Without dead ends: 2051 [2025-03-04 01:38:41,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:38:41,194 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 55 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:41,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 414 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-04 01:38:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1539. [2025-03-04 01:38:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1360 states have (on average 1.214705882352941) internal successors, (1652), 1378 states have internal predecessors, (1652), 144 states have call successors, (144), 34 states have call predecessors, (144), 34 states have return successors, (144), 126 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:38:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1940 transitions. [2025-03-04 01:38:41,254 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1940 transitions. Word has length 145 [2025-03-04 01:38:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:41,254 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 1940 transitions. [2025-03-04 01:38:41,254 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:38:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1940 transitions. [2025-03-04 01:38:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:41,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:41,256 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:38:41,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -367239370, now seen corresponding path program 1 times [2025-03-04 01:38:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685957964] [2025-03-04 01:38:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:41,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:41,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685957964] [2025-03-04 01:38:41,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685957964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:41,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106312145] [2025-03-04 01:38:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:41,537 INFO L87 Difference]: Start difference. First operand 1539 states and 1940 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:41,869 INFO L93 Difference]: Finished difference Result 3266 states and 4120 transitions. [2025-03-04 01:38:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:41,870 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-03-04 01:38:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:41,875 INFO L225 Difference]: With dead ends: 3266 [2025-03-04 01:38:41,876 INFO L226 Difference]: Without dead ends: 1743 [2025-03-04 01:38:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:38:41,878 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 466 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-04 01:38:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-03-04 01:38:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1533 states have (on average 1.20808871493803) internal successors, (1852), 1553 states have internal predecessors, (1852), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 01:38:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2184 transitions. [2025-03-04 01:38:41,977 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2184 transitions. Word has length 145 [2025-03-04 01:38:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:41,977 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2184 transitions. [2025-03-04 01:38:41,978 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2184 transitions. [2025-03-04 01:38:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:41,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:41,984 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:41,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:38:41,984 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -563752875, now seen corresponding path program 1 times [2025-03-04 01:38:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199531705] [2025-03-04 01:38:41,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:42,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:42,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:42,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:38:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199531705] [2025-03-04 01:38:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199531705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:38:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789257488] [2025-03-04 01:38:42,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:38:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:42,115 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:38:42,117 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:38:42,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:42,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:42,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:42,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:38:42,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:42,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789257488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:38:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-04 01:38:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772689818] [2025-03-04 01:38:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:38:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:38:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:38:42,291 INFO L87 Difference]: Start difference. First operand 1739 states and 2184 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:42,368 INFO L93 Difference]: Finished difference Result 3516 states and 4412 transitions. [2025-03-04 01:38:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:38:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-04 01:38:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:42,374 INFO L225 Difference]: With dead ends: 3516 [2025-03-04 01:38:42,374 INFO L226 Difference]: Without dead ends: 1793 [2025-03-04 01:38:42,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:38:42,376 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:42,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-04 01:38:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1721. [2025-03-04 01:38:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1515 states have (on average 1.2046204620462047) internal successors, (1825), 1535 states have internal predecessors, (1825), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 01:38:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2157 transitions. [2025-03-04 01:38:42,447 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2157 transitions. Word has length 145 [2025-03-04 01:38:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2157 transitions. [2025-03-04 01:38:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:38:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2157 transitions. [2025-03-04 01:38:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:42,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:42,449 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:38:42,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 01:38:42,651 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1612003851, now seen corresponding path program 1 times [2025-03-04 01:38:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248701371] [2025-03-04 01:38:42,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:42,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:42,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:42,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:42,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248701371] [2025-03-04 01:38:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248701371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:38:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200124422] [2025-03-04 01:38:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:38:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:43,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:38:43,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:38:43,281 INFO L87 Difference]: Start difference. First operand 1721 states and 2157 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:43,639 INFO L93 Difference]: Finished difference Result 2927 states and 3677 transitions. [2025-03-04 01:38:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:38:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-03-04 01:38:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:43,646 INFO L225 Difference]: With dead ends: 2927 [2025-03-04 01:38:43,646 INFO L226 Difference]: Without dead ends: 1751 [2025-03-04 01:38:43,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:38:43,649 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:43,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1193 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-04 01:38:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1649. [2025-03-04 01:38:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1454 states have (on average 1.2056396148555708) internal successors, (1753), 1472 states have internal predecessors, (1753), 156 states have call successors, (156), 38 states have call predecessors, (156), 38 states have return successors, (156), 138 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-04 01:38:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2065 transitions. [2025-03-04 01:38:43,714 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2065 transitions. Word has length 145 [2025-03-04 01:38:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:43,714 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2065 transitions. [2025-03-04 01:38:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:38:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2065 transitions. [2025-03-04 01:38:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:43,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:43,718 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:38:43,718 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -583498748, now seen corresponding path program 1 times [2025-03-04 01:38:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679796968] [2025-03-04 01:38:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:43,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:43,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:43,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:43,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:45,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679796968] [2025-03-04 01:38:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679796968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:45,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:45,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:38:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157745229] [2025-03-04 01:38:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:45,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:38:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:45,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:38:45,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:38:45,400 INFO L87 Difference]: Start difference. First operand 1649 states and 2065 transitions. Second operand has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:46,538 INFO L93 Difference]: Finished difference Result 3544 states and 4421 transitions. [2025-03-04 01:38:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:38:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-04 01:38:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:46,548 INFO L225 Difference]: With dead ends: 3544 [2025-03-04 01:38:46,548 INFO L226 Difference]: Without dead ends: 1911 [2025-03-04 01:38:46,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:38:46,551 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 226 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:46,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1436 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:38:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-04 01:38:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1611. [2025-03-04 01:38:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1418 states have (on average 1.2094499294781382) internal successors, (1715), 1435 states have internal predecessors, (1715), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 01:38:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2019 transitions. [2025-03-04 01:38:46,621 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2019 transitions. Word has length 145 [2025-03-04 01:38:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:46,621 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2019 transitions. [2025-03-04 01:38:46,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2019 transitions. [2025-03-04 01:38:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:38:46,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:46,623 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:38:46,624 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 876616875, now seen corresponding path program 1 times [2025-03-04 01:38:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953843348] [2025-03-04 01:38:46,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:46,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:38:46,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:38:46,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:46,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:48,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953843348] [2025-03-04 01:38:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953843348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:48,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:38:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329205502] [2025-03-04 01:38:48,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:48,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:38:48,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:48,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:38:48,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:38:48,496 INFO L87 Difference]: Start difference. First operand 1611 states and 2019 transitions. Second operand has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:38:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:50,354 INFO L93 Difference]: Finished difference Result 3226 states and 4037 transitions. [2025-03-04 01:38:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:38:50,356 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 145 [2025-03-04 01:38:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:50,361 INFO L225 Difference]: With dead ends: 3226 [2025-03-04 01:38:50,361 INFO L226 Difference]: Without dead ends: 1618 [2025-03-04 01:38:50,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:38:50,366 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 386 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:50,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 862 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:38:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-04 01:38:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1601. [2025-03-04 01:38:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1408 states have (on average 1.2066761363636365) internal successors, (1699), 1425 states have internal predecessors, (1699), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 01:38:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2003 transitions. [2025-03-04 01:38:50,435 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2003 transitions. Word has length 145 [2025-03-04 01:38:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:50,435 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2003 transitions. [2025-03-04 01:38:50,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:38:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2003 transitions. [2025-03-04 01:38:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:38:50,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:50,437 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:38:50,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:50,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 739320050, now seen corresponding path program 1 times [2025-03-04 01:38:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:50,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174963924] [2025-03-04 01:38:50,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:50,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:38:50,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:38:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:52,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174963924] [2025-03-04 01:38:52,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174963924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:52,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:52,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:38:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533850770] [2025-03-04 01:38:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:38:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:52,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:38:52,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:38:52,184 INFO L87 Difference]: Start difference. First operand 1601 states and 2003 transitions. Second operand has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:54,214 INFO L93 Difference]: Finished difference Result 2752 states and 3448 transitions. [2025-03-04 01:38:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:38:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-03-04 01:38:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:54,220 INFO L225 Difference]: With dead ends: 2752 [2025-03-04 01:38:54,220 INFO L226 Difference]: Without dead ends: 1652 [2025-03-04 01:38:54,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:38:54,223 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 247 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:54,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1737 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:38:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-03-04 01:38:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1609. [2025-03-04 01:38:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1416 states have (on average 1.2055084745762712) internal successors, (1707), 1433 states have internal predecessors, (1707), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 01:38:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2011 transitions. [2025-03-04 01:38:54,295 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2011 transitions. Word has length 146 [2025-03-04 01:38:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:54,295 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2011 transitions. [2025-03-04 01:38:54,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:38:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2011 transitions. [2025-03-04 01:38:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:38:54,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:54,296 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:38:54,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1517740760, now seen corresponding path program 1 times [2025-03-04 01:38:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733732060] [2025-03-04 01:38:54,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:54,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:38:54,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:38:54,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:38:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733732060] [2025-03-04 01:38:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733732060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:56,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-04 01:38:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428101446] [2025-03-04 01:38:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 01:38:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:56,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 01:38:56,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:38:56,689 INFO L87 Difference]: Start difference. First operand 1609 states and 2011 transitions. Second operand has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:39:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:00,927 INFO L93 Difference]: Finished difference Result 1802 states and 2227 transitions. [2025-03-04 01:39:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 01:39:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-04 01:39:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:00,933 INFO L225 Difference]: With dead ends: 1802 [2025-03-04 01:39:00,933 INFO L226 Difference]: Without dead ends: 1800 [2025-03-04 01:39:00,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=472, Invalid=4358, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 01:39:00,935 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 411 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:00,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1246 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:39:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-04 01:39:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1688. [2025-03-04 01:39:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1495 states have (on average 1.1959866220735786) internal successors, (1788), 1512 states have internal predecessors, (1788), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 01:39:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2092 transitions. [2025-03-04 01:39:01,018 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2092 transitions. Word has length 147 [2025-03-04 01:39:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:01,018 INFO L471 AbstractCegarLoop]: Abstraction has 1688 states and 2092 transitions. [2025-03-04 01:39:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:39:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2092 transitions. [2025-03-04 01:39:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:39:01,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:01,020 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:39:01,020 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:01,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1773697452, now seen corresponding path program 1 times [2025-03-04 01:39:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:01,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189317169] [2025-03-04 01:39:01,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:01,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:39:01,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:39:01,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:01,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:39:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189317169] [2025-03-04 01:39:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189317169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:02,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:39:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305690548] [2025-03-04 01:39:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:39:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:02,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:39:02,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:39:02,130 INFO L87 Difference]: Start difference. First operand 1688 states and 2092 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:02,702 INFO L93 Difference]: Finished difference Result 3495 states and 4316 transitions. [2025-03-04 01:39:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:39:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-04 01:39:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:02,707 INFO L225 Difference]: With dead ends: 3495 [2025-03-04 01:39:02,707 INFO L226 Difference]: Without dead ends: 1810 [2025-03-04 01:39:02,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:39:02,710 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 101 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:02,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 773 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:39:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-04 01:39:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1716. [2025-03-04 01:39:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1523 states have (on average 1.1917268548916613) internal successors, (1815), 1540 states have internal predecessors, (1815), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 01:39:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2119 transitions. [2025-03-04 01:39:02,774 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2119 transitions. Word has length 147 [2025-03-04 01:39:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:02,774 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2119 transitions. [2025-03-04 01:39:02,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2119 transitions. [2025-03-04 01:39:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:39:02,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:02,776 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:39:02,776 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -272976279, now seen corresponding path program 1 times [2025-03-04 01:39:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049581572] [2025-03-04 01:39:02,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:02,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:39:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:39:02,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:02,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:39:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049581572] [2025-03-04 01:39:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049581572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:39:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008642882] [2025-03-04 01:39:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:02,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:02,882 INFO L87 Difference]: Start difference. First operand 1716 states and 2119 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:39:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:03,126 INFO L93 Difference]: Finished difference Result 4157 states and 5104 transitions. [2025-03-04 01:39:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:03,127 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-04 01:39:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:03,132 INFO L225 Difference]: With dead ends: 4157 [2025-03-04 01:39:03,132 INFO L226 Difference]: Without dead ends: 2444 [2025-03-04 01:39:03,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:03,135 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:03,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 420 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:39:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-03-04 01:39:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2044. [2025-03-04 01:39:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1830 states have (on average 1.1825136612021858) internal successors, (2164), 1849 states have internal predecessors, (2164), 168 states have call successors, (168), 45 states have call predecessors, (168), 45 states have return successors, (168), 149 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:39:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2500 transitions. [2025-03-04 01:39:03,217 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2500 transitions. Word has length 147 [2025-03-04 01:39:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2500 transitions. [2025-03-04 01:39:03,217 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:39:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2500 transitions. [2025-03-04 01:39:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:39:03,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:03,219 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:39:03,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1906803477, now seen corresponding path program 1 times [2025-03-04 01:39:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542606829] [2025-03-04 01:39:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:03,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:39:03,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:39:03,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:03,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:39:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542606829] [2025-03-04 01:39:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542606829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:39:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949259994] [2025-03-04 01:39:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:39:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:04,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:39:04,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:04,077 INFO L87 Difference]: Start difference. First operand 2044 states and 2500 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:04,345 INFO L93 Difference]: Finished difference Result 4172 states and 5099 transitions. [2025-03-04 01:39:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:39:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-04 01:39:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:04,350 INFO L225 Difference]: With dead ends: 4172 [2025-03-04 01:39:04,350 INFO L226 Difference]: Without dead ends: 2131 [2025-03-04 01:39:04,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:04,353 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 35 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:04,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2025-03-04 01:39:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1886. [2025-03-04 01:39:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1672 states have (on average 1.1776315789473684) internal successors, (1969), 1691 states have internal predecessors, (1969), 168 states have call successors, (168), 45 states have call predecessors, (168), 45 states have return successors, (168), 149 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 01:39:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2305 transitions. [2025-03-04 01:39:04,430 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2305 transitions. Word has length 148 [2025-03-04 01:39:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:04,430 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 2305 transitions. [2025-03-04 01:39:04,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2305 transitions. [2025-03-04 01:39:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:39:04,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:04,431 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:39:04,432 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -316003409, now seen corresponding path program 1 times [2025-03-04 01:39:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632656847] [2025-03-04 01:39:04,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:39:04,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:39:04,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:04,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:39:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632656847] [2025-03-04 01:39:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632656847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:05,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:05,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:39:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700635342] [2025-03-04 01:39:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:39:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:05,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:39:05,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:39:05,777 INFO L87 Difference]: Start difference. First operand 1886 states and 2305 transitions. Second operand has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:39:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:06,838 INFO L93 Difference]: Finished difference Result 4029 states and 4900 transitions. [2025-03-04 01:39:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:39:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) Word has length 148 [2025-03-04 01:39:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:06,844 INFO L225 Difference]: With dead ends: 4029 [2025-03-04 01:39:06,844 INFO L226 Difference]: Without dead ends: 2146 [2025-03-04 01:39:06,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:39:06,847 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 157 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:06,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1445 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:39:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-03-04 01:39:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2053. [2025-03-04 01:39:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1821 states have (on average 1.1696869851729819) internal successors, (2130), 1842 states have internal predecessors, (2130), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 159 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-04 01:39:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2490 transitions. [2025-03-04 01:39:06,942 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2490 transitions. Word has length 148 [2025-03-04 01:39:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2490 transitions. [2025-03-04 01:39:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:39:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2490 transitions. [2025-03-04 01:39:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:39:06,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:06,944 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:39:06,945 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:06,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1497343756, now seen corresponding path program 1 times [2025-03-04 01:39:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:06,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553296091] [2025-03-04 01:39:06,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:06,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:39:06,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:39:06,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:06,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:39:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:07,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553296091] [2025-03-04 01:39:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553296091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:07,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:39:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823804635] [2025-03-04 01:39:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:07,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:39:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:07,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:39:07,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:39:07,865 INFO L87 Difference]: Start difference. First operand 2053 states and 2490 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:08,178 INFO L93 Difference]: Finished difference Result 3690 states and 4482 transitions. [2025-03-04 01:39:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:39:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-04 01:39:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:08,183 INFO L225 Difference]: With dead ends: 3690 [2025-03-04 01:39:08,183 INFO L226 Difference]: Without dead ends: 2330 [2025-03-04 01:39:08,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:39:08,185 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 75 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:08,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 672 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-04 01:39:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2133. [2025-03-04 01:39:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1901 states have (on average 1.1709626512361915) internal successors, (2226), 1922 states have internal predecessors, (2226), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 159 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-04 01:39:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2586 transitions. [2025-03-04 01:39:08,281 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2586 transitions. Word has length 148 [2025-03-04 01:39:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:08,281 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 2586 transitions. [2025-03-04 01:39:08,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:39:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2586 transitions. [2025-03-04 01:39:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:39:08,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:08,283 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:39:08,283 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -211871601, now seen corresponding path program 1 times [2025-03-04 01:39:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683965647] [2025-03-04 01:39:08,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:39:08,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:39:08,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:08,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat