./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-sp_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:08,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:08,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:12:08,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:08,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:08,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:08,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:08,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:08,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:08,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:08,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:08,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:08,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:08,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:08,184 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:08,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:08,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:08,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:08,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:12:08,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:08,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:08,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:08,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:12:08,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:12:08,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:08,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:08,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:08,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:08,187 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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2025-03-17 06:12:08,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:08,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:08,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:08,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:08,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:08,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-17 06:12:09,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9473ed441/36c811af0bae42dcb3046213bfe2be82/FLAGf0e60a559 [2025-03-17 06:12:09,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:09,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-17 06:12:09,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9473ed441/36c811af0bae42dcb3046213bfe2be82/FLAGf0e60a559 [2025-03-17 06:12:09,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9473ed441/36c811af0bae42dcb3046213bfe2be82 [2025-03-17 06:12:09,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:09,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:09,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:09,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:09,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:09,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:09" (1/1) ... [2025-03-17 06:12:09,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ac2edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:09, skipping insertion in model container [2025-03-17 06:12:09,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:09" (1/1) ... [2025-03-17 06:12:09,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:10,000 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-sp_file-71.i[917,930] [2025-03-17 06:12:10,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:10,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:10,058 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-sp_file-71.i[917,930] [2025-03-17 06:12:10,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:10,101 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:10,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10 WrapperNode [2025-03-17 06:12:10,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:10,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:10,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:10,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:10,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,141 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2025-03-17 06:12:10,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:10,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:10,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:10,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:10,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,172 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-17 06:12:10,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:10,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:10,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:10,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:10,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (1/1) ... [2025-03-17 06:12:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:10,231 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-17 06:12:10,234 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-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:10,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:12:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:12:10,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:10,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:10,341 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:10,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:10,697 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~mem75#1;havoc property_#t~ite103#1;havoc property_#t~mem89#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short92#1;havoc property_#t~ite102#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem122#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-17 06:12:10,732 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:10,733 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:10,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:10,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:10,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:10 BoogieIcfgContainer [2025-03-17 06:12:10,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:10,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:10,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:10,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:10,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:09" (1/3) ... [2025-03-17 06:12:10,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30392c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:10, skipping insertion in model container [2025-03-17 06:12:10,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:10" (2/3) ... [2025-03-17 06:12:10,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30392c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:10, skipping insertion in model container [2025-03-17 06:12:10,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:10" (3/3) ... [2025-03-17 06:12:10,751 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2025-03-17 06:12:10,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:10,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-71.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:10,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:10,816 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;@ed8b0b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:10,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:12:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 06:12:10,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:10,832 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:10,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1075573019, now seen corresponding path program 1 times [2025-03-17 06:12:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126178429] [2025-03-17 06:12:10,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:10,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:12:10,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:12:10,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 06:12:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126178429] [2025-03-17 06:12:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126178429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942474355] [2025-03-17 06:12:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:11,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:11,115 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-17 06:12:11,117 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-17 06:12:11,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:12:11,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:12:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:11,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 06:12:11,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942474355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:12:11,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538980769] [2025-03-17 06:12:11,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:11,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:11,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:11,356 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:12:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:11,373 INFO L93 Difference]: Finished difference Result 195 states and 309 transitions. [2025-03-17 06:12:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 140 [2025-03-17 06:12:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:11,381 INFO L225 Difference]: With dead ends: 195 [2025-03-17 06:12:11,382 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 06:12:11,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-17 06:12:11,389 INFO L435 NwaCegarLoop]: 140 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, 140 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-17 06:12:11,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 06:12:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 06:12:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:12:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-03-17 06:12:11,424 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 140 [2025-03-17 06:12:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:11,425 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-03-17 06:12:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:12:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-03-17 06:12:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 06:12:11,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:11,429 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:11,435 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-17 06:12:11,630 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-17 06:12:11,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1299612008, now seen corresponding path program 1 times [2025-03-17 06:12:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469435481] [2025-03-17 06:12:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:11,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:12:11,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:12:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469435481] [2025-03-17 06:12:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469435481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727857043] [2025-03-17 06:12:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:11,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:11,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:11,930 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:11,975 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-17 06:12:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-17 06:12:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:11,977 INFO L225 Difference]: With dead ends: 196 [2025-03-17 06:12:11,977 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 06:12:11,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:11,978 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:11,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 06:12:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 06:12:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:12:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2025-03-17 06:12:11,987 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 140 [2025-03-17 06:12:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2025-03-17 06:12:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2025-03-17 06:12:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 06:12:11,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:11,990 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:11,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:12:11,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:11,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2107851607, now seen corresponding path program 1 times [2025-03-17 06:12:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108562093] [2025-03-17 06:12:11,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:12,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:12:12,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:12:12,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:12,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108562093] [2025-03-17 06:12:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108562093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:12,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761357948] [2025-03-17 06:12:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:12,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:12,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:12,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:12,177 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:12,203 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-03-17 06:12:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-17 06:12:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:12,207 INFO L225 Difference]: With dead ends: 200 [2025-03-17 06:12:12,207 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:12:12,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:12,208 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:12,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:12:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:12:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:12:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-17 06:12:12,215 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 140 [2025-03-17 06:12:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:12,216 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-17 06:12:12,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-17 06:12:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 06:12:12,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:12,217 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:12:12,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:12,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2106928086, now seen corresponding path program 1 times [2025-03-17 06:12:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588712793] [2025-03-17 06:12:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:12,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:12:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:12:12,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:13,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:13,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588712793] [2025-03-17 06:12:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588712793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:13,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294733638] [2025-03-17 06:12:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:13,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:13,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:13,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:13,358 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:13,826 INFO L93 Difference]: Finished difference Result 234 states and 331 transitions. [2025-03-17 06:12:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 140 [2025-03-17 06:12:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:13,828 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:12:13,830 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 06:12:13,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:13,832 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 221 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:13,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 291 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 06:12:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2025-03-17 06:12:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 96 states have internal predecessors, (121), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:12:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2025-03-17 06:12:13,846 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 140 [2025-03-17 06:12:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2025-03-17 06:12:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2025-03-17 06:12:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 06:12:13,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:13,848 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:12:13,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -438142369, now seen corresponding path program 1 times [2025-03-17 06:12:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577708162] [2025-03-17 06:12:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:13,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 06:12:13,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 06:12:13,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577708162] [2025-03-17 06:12:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577708162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:15,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046366414] [2025-03-17 06:12:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:15,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:12:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:15,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:12:15,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:15,423 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,363 INFO L93 Difference]: Finished difference Result 313 states and 443 transitions. [2025-03-17 06:12:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:12:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 141 [2025-03-17 06:12:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,366 INFO L225 Difference]: With dead ends: 313 [2025-03-17 06:12:16,368 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 06:12:16,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:16,370 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 381 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 473 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:12:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 06:12:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2025-03-17 06:12:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 138 states have (on average 1.318840579710145) internal successors, (182), 139 states have internal predecessors, (182), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:12:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2025-03-17 06:12:16,396 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 141 [2025-03-17 06:12:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2025-03-17 06:12:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2025-03-17 06:12:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 06:12:16,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,399 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:16,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:12:16,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash 87499360, now seen corresponding path program 1 times [2025-03-17 06:12:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934286111] [2025-03-17 06:12:16,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 06:12:16,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 06:12:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934286111] [2025-03-17 06:12:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934286111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:12:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964735624] [2025-03-17 06:12:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:18,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:12:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:18,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:12:18,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:18,001 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:18,942 INFO L93 Difference]: Finished difference Result 444 states and 624 transitions. [2025-03-17 06:12:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:12:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2025-03-17 06:12:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:18,944 INFO L225 Difference]: With dead ends: 444 [2025-03-17 06:12:18,944 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 06:12:18,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:12:18,945 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 429 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:18,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 348 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:12:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 06:12:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 170. [2025-03-17 06:12:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 138 states have (on average 1.318840579710145) internal successors, (182), 139 states have internal predecessors, (182), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:12:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2025-03-17 06:12:18,969 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 142 [2025-03-17 06:12:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:18,970 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2025-03-17 06:12:18,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2025-03-17 06:12:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 06:12:18,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:18,972 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:18,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:12:18,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 394611733, now seen corresponding path program 1 times [2025-03-17 06:12:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:18,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472029487] [2025-03-17 06:12:18,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:18,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 06:12:19,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 06:12:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472029487] [2025-03-17 06:12:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472029487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632436418] [2025-03-17 06:12:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:12:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:12:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:20,538 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:12:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:20,990 INFO L93 Difference]: Finished difference Result 420 states and 591 transitions. [2025-03-17 06:12:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:20,992 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), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 142 [2025-03-17 06:12:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:20,993 INFO L225 Difference]: With dead ends: 420 [2025-03-17 06:12:20,993 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 06:12:20,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:20,995 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:20,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 304 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 06:12:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 186. [2025-03-17 06:12:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 155 states have internal predecessors, (205), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:12:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 263 transitions. [2025-03-17 06:12:21,016 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 263 transitions. Word has length 142 [2025-03-17 06:12:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:21,017 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 263 transitions. [2025-03-17 06:12:21,017 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), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:12:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 263 transitions. [2025-03-17 06:12:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 06:12:21,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:21,018 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:21,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:12:21,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -871633593, now seen corresponding path program 1 times [2025-03-17 06:12:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:21,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108737824] [2025-03-17 06:12:21,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:21,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 06:12:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 06:12:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108737824] [2025-03-17 06:12:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108737824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:12:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129332738] [2025-03-17 06:12:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:12:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:22,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:12:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:22,474 INFO L87 Difference]: Start difference. First operand 186 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:23,349 INFO L93 Difference]: Finished difference Result 416 states and 585 transitions. [2025-03-17 06:12:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2025-03-17 06:12:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:23,354 INFO L225 Difference]: With dead ends: 416 [2025-03-17 06:12:23,354 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 06:12:23,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:23,355 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 217 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:23,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 640 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:12:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 06:12:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 199. [2025-03-17 06:12:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 168 states have internal predecessors, (223), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 06:12:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 281 transitions. [2025-03-17 06:12:23,374 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 281 transitions. Word has length 142 [2025-03-17 06:12:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:23,374 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 281 transitions. [2025-03-17 06:12:23,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 281 transitions. [2025-03-17 06:12:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:23,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:23,376 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:12:23,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 808639036, now seen corresponding path program 1 times [2025-03-17 06:12:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:23,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617030673] [2025-03-17 06:12:23,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:23,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:23,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:23,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617030673] [2025-03-17 06:12:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617030673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:12:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527734162] [2025-03-17 06:12:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:12:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:24,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:12:24,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:24,864 INFO L87 Difference]: Start difference. First operand 199 states and 281 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:12:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:25,905 INFO L93 Difference]: Finished difference Result 472 states and 660 transitions. [2025-03-17 06:12:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:12:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 143 [2025-03-17 06:12:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:25,908 INFO L225 Difference]: With dead ends: 472 [2025-03-17 06:12:25,908 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 06:12:25,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:12:25,908 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 359 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:25,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 571 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:12:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 06:12:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2025-03-17 06:12:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 222 states have internal predecessors, (285), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 06:12:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 375 transitions. [2025-03-17 06:12:25,945 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 375 transitions. Word has length 143 [2025-03-17 06:12:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:25,946 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 375 transitions. [2025-03-17 06:12:25,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:12:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 375 transitions. [2025-03-17 06:12:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:25,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:25,947 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:12:25,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -490363852, now seen corresponding path program 1 times [2025-03-17 06:12:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492050900] [2025-03-17 06:12:25,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:25,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:26,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:26,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:26,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492050900] [2025-03-17 06:12:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492050900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334690848] [2025-03-17 06:12:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:27,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:27,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:27,402 INFO L87 Difference]: Start difference. First operand 269 states and 375 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:27,802 INFO L93 Difference]: Finished difference Result 586 states and 815 transitions. [2025-03-17 06:12:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 143 [2025-03-17 06:12:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:27,804 INFO L225 Difference]: With dead ends: 586 [2025-03-17 06:12:27,804 INFO L226 Difference]: Without dead ends: 338 [2025-03-17 06:12:27,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:27,807 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 347 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:27,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 304 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-17 06:12:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 271. [2025-03-17 06:12:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 221 states have (on average 1.2986425339366516) internal successors, (287), 224 states have internal predecessors, (287), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 06:12:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2025-03-17 06:12:27,842 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 143 [2025-03-17 06:12:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:27,842 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2025-03-17 06:12:27,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2025-03-17 06:12:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:27,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:27,846 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:27,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:12:27,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:27,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1821238236, now seen corresponding path program 1 times [2025-03-17 06:12:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585932642] [2025-03-17 06:12:27,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:27,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:27,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585932642] [2025-03-17 06:12:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585932642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:12:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83035267] [2025-03-17 06:12:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:29,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:12:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:29,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:12:29,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:29,100 INFO L87 Difference]: Start difference. First operand 271 states and 377 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:29,682 INFO L93 Difference]: Finished difference Result 609 states and 843 transitions. [2025-03-17 06:12:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 143 [2025-03-17 06:12:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:29,684 INFO L225 Difference]: With dead ends: 609 [2025-03-17 06:12:29,684 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 06:12:29,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:12:29,685 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 275 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:29,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 583 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 06:12:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 301. [2025-03-17 06:12:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 251 states have (on average 1.302788844621514) internal successors, (327), 254 states have internal predecessors, (327), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 06:12:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 417 transitions. [2025-03-17 06:12:29,724 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 417 transitions. Word has length 143 [2025-03-17 06:12:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:29,725 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 417 transitions. [2025-03-17 06:12:29,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 417 transitions. [2025-03-17 06:12:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:29,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:29,726 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:12:29,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -966177251, now seen corresponding path program 1 times [2025-03-17 06:12:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580789941] [2025-03-17 06:12:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:29,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:29,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:29,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580789941] [2025-03-17 06:12:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580789941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:12:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852251152] [2025-03-17 06:12:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:34,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:12:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:34,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:12:34,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:34,629 INFO L87 Difference]: Start difference. First operand 301 states and 417 transitions. Second operand has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:41,489 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2025-03-17 06:12:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:12:41,490 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 143 [2025-03-17 06:12:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:41,492 INFO L225 Difference]: With dead ends: 747 [2025-03-17 06:12:41,492 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 06:12:41,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:12:41,493 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 366 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:41,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 644 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 06:12:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 06:12:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 387. [2025-03-17 06:12:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 330 states have (on average 1.293939393939394) internal successors, (427), 335 states have internal predecessors, (427), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 06:12:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2025-03-17 06:12:41,558 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 143 [2025-03-17 06:12:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2025-03-17 06:12:41,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2025-03-17 06:12:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:41,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:41,560 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:41,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:12:41,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:41,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -754826338, now seen corresponding path program 1 times [2025-03-17 06:12:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:41,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862326461] [2025-03-17 06:12:41,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:41,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:41,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:41,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:41,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:44,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862326461] [2025-03-17 06:12:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862326461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:12:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170541891] [2025-03-17 06:12:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:12:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:12:44,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:44,827 INFO L87 Difference]: Start difference. First operand 387 states and 525 transitions. Second operand has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:46,693 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2025-03-17 06:12:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:12:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 143 [2025-03-17 06:12:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:46,696 INFO L225 Difference]: With dead ends: 839 [2025-03-17 06:12:46,696 INFO L226 Difference]: Without dead ends: 477 [2025-03-17 06:12:46,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:12:46,698 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 295 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:46,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 879 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:12:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-17 06:12:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 385. [2025-03-17 06:12:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 328 states have (on average 1.2896341463414633) internal successors, (423), 333 states have internal predecessors, (423), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 06:12:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 521 transitions. [2025-03-17 06:12:46,765 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 521 transitions. Word has length 143 [2025-03-17 06:12:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:46,765 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 521 transitions. [2025-03-17 06:12:46,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 521 transitions. [2025-03-17 06:12:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:46,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:46,766 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:12:46,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -255971107, now seen corresponding path program 1 times [2025-03-17 06:12:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911934445] [2025-03-17 06:12:46,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:46,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911934445] [2025-03-17 06:12:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911934445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:12:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895309271] [2025-03-17 06:12:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:49,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:12:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:49,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:12:49,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:49,728 INFO L87 Difference]: Start difference. First operand 385 states and 521 transitions. Second operand has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:51,786 INFO L93 Difference]: Finished difference Result 881 states and 1181 transitions. [2025-03-17 06:12:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:12:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 143 [2025-03-17 06:12:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:51,792 INFO L225 Difference]: With dead ends: 881 [2025-03-17 06:12:51,792 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 06:12:51,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:12:51,793 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 427 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:51,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 623 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 06:12:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 06:12:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 359. [2025-03-17 06:12:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 308 states have internal predecessors, (390), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:12:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-03-17 06:12:51,848 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 143 [2025-03-17 06:12:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-03-17 06:12:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:12:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-03-17 06:12:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:51,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:51,849 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:51,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:12:51,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1251580702, now seen corresponding path program 1 times [2025-03-17 06:12:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690264602] [2025-03-17 06:12:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:51,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:51,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:51,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690264602] [2025-03-17 06:12:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690264602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:52,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:52,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342000503] [2025-03-17 06:12:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:52,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:52,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:52,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:52,243 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:52,735 INFO L93 Difference]: Finished difference Result 751 states and 1012 transitions. [2025-03-17 06:12:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2025-03-17 06:12:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:52,737 INFO L225 Difference]: With dead ends: 751 [2025-03-17 06:12:52,737 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 06:12:52,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:52,738 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 143 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:52,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 792 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 06:12:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 359. [2025-03-17 06:12:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 308 states have internal predecessors, (390), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:12:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-03-17 06:12:52,792 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 143 [2025-03-17 06:12:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:52,792 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-03-17 06:12:52,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-03-17 06:12:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:12:52,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:52,793 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:12:52,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -465826696, now seen corresponding path program 1 times [2025-03-17 06:12:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531637186] [2025-03-17 06:12:52,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:12:52,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:12:52,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531637186] [2025-03-17 06:12:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531637186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:53,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998877003] [2025-03-17 06:12:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:12:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:53,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:12:53,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:53,813 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:54,205 INFO L93 Difference]: Finished difference Result 732 states and 988 transitions. [2025-03-17 06:12:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:54,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2025-03-17 06:12:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:54,207 INFO L225 Difference]: With dead ends: 732 [2025-03-17 06:12:54,207 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 06:12:54,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:12:54,208 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 255 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:54,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 542 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 06:12:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 359. [2025-03-17 06:12:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 308 states have internal predecessors, (390), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:12:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-03-17 06:12:54,263 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 143 [2025-03-17 06:12:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-03-17 06:12:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:12:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-03-17 06:12:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:12:54,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:54,264 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:54,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:12:54,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:54,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 83017251, now seen corresponding path program 1 times [2025-03-17 06:12:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586204994] [2025-03-17 06:12:54,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:54,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:12:54,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:12:54,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:54,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586204994] [2025-03-17 06:12:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586204994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:12:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710169269] [2025-03-17 06:12:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:55,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:12:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:12:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:12:55,648 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:56,446 INFO L93 Difference]: Finished difference Result 751 states and 1012 transitions. [2025-03-17 06:12:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:12:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2025-03-17 06:12:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:56,448 INFO L225 Difference]: With dead ends: 751 [2025-03-17 06:12:56,448 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 06:12:56,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:12:56,449 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 426 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:56,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 440 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 06:12:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2025-03-17 06:12:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 345 states have (on average 1.2782608695652173) internal successors, (441), 350 states have internal predecessors, (441), 55 states have call successors, (55), 8 states have call predecessors, (55), 8 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 06:12:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 551 transitions. [2025-03-17 06:12:56,515 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 551 transitions. Word has length 144 [2025-03-17 06:12:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 551 transitions. [2025-03-17 06:12:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 551 transitions. [2025-03-17 06:12:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:12:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:56,516 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:12:56,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash 156798877, now seen corresponding path program 1 times [2025-03-17 06:12:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311731536] [2025-03-17 06:12:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:56,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:12:56,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:12:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:56,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:12:58,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:58,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311731536] [2025-03-17 06:12:58,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311731536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:58,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:58,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:12:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346582466] [2025-03-17 06:12:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:58,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:12:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:58,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:12:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:12:58,149 INFO L87 Difference]: Start difference. First operand 409 states and 551 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:59,054 INFO L93 Difference]: Finished difference Result 925 states and 1241 transitions. [2025-03-17 06:12:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:12:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2025-03-17 06:12:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:59,057 INFO L225 Difference]: With dead ends: 925 [2025-03-17 06:12:59,057 INFO L226 Difference]: Without dead ends: 541 [2025-03-17 06:12:59,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:12:59,058 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 243 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:59,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 568 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-17 06:12:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 427. [2025-03-17 06:12:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 363 states have (on average 1.2727272727272727) internal successors, (462), 368 states have internal predecessors, (462), 55 states have call successors, (55), 8 states have call predecessors, (55), 8 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 06:12:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 572 transitions. [2025-03-17 06:12:59,124 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 572 transitions. Word has length 144 [2025-03-17 06:12:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:59,125 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 572 transitions. [2025-03-17 06:12:59,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:12:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 572 transitions. [2025-03-17 06:12:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:12:59,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:59,126 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:59,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:12:59,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:59,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1664350686, now seen corresponding path program 1 times [2025-03-17 06:12:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253217125] [2025-03-17 06:12:59,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:59,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:12:59,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:12:59,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:59,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253217125] [2025-03-17 06:13:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253217125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:13:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104820590] [2025-03-17 06:13:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:13:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:02,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:13:02,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:13:02,825 INFO L87 Difference]: Start difference. First operand 427 states and 572 transitions. Second operand has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:04,297 INFO L93 Difference]: Finished difference Result 958 states and 1275 transitions. [2025-03-17 06:13:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:13:04,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 144 [2025-03-17 06:13:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:04,300 INFO L225 Difference]: With dead ends: 958 [2025-03-17 06:13:04,300 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 06:13:04,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:13:04,301 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 334 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:04,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 586 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:13:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 06:13:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 431. [2025-03-17 06:13:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 364 states have (on average 1.271978021978022) internal successors, (463), 370 states have internal predecessors, (463), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:13:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 577 transitions. [2025-03-17 06:13:04,373 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 577 transitions. Word has length 144 [2025-03-17 06:13:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:04,373 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 577 transitions. [2025-03-17 06:13:04,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 577 transitions. [2025-03-17 06:13:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:04,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:04,374 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:13:04,375 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:04,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 187818684, now seen corresponding path program 1 times [2025-03-17 06:13:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146311882] [2025-03-17 06:13:04,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:04,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:04,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:04,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:04,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146311882] [2025-03-17 06:13:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146311882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:13:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108484844] [2025-03-17 06:13:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:07,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:13:07,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:07,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:13:07,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:13:07,814 INFO L87 Difference]: Start difference. First operand 431 states and 577 transitions. Second operand has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:09,238 INFO L93 Difference]: Finished difference Result 954 states and 1268 transitions. [2025-03-17 06:13:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:13:09,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 144 [2025-03-17 06:13:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:09,241 INFO L225 Difference]: With dead ends: 954 [2025-03-17 06:13:09,241 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 06:13:09,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:13:09,242 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 342 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:09,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 495 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:13:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 06:13:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 355. [2025-03-17 06:13:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 300 states have (on average 1.28) internal successors, (384), 304 states have internal predecessors, (384), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:13:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 478 transitions. [2025-03-17 06:13:09,306 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 478 transitions. Word has length 144 [2025-03-17 06:13:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 478 transitions. [2025-03-17 06:13:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 16 states have internal predecessors, (52), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 478 transitions. [2025-03-17 06:13:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:09,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:09,307 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:13:09,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1695370493, now seen corresponding path program 1 times [2025-03-17 06:13:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508350306] [2025-03-17 06:13:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:09,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:09,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508350306] [2025-03-17 06:13:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508350306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:13:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833325231] [2025-03-17 06:13:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:09,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:13:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:09,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:13:09,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:13:09,783 INFO L87 Difference]: Start difference. First operand 355 states and 478 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:13:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:10,153 INFO L93 Difference]: Finished difference Result 743 states and 998 transitions. [2025-03-17 06:13:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:13:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 06:13:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:10,155 INFO L225 Difference]: With dead ends: 743 [2025-03-17 06:13:10,155 INFO L226 Difference]: Without dead ends: 413 [2025-03-17 06:13:10,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:13:10,156 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 188 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:10,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 782 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:13:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-17 06:13:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2025-03-17 06:13:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 286 states have internal predecessors, (363), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 06:13:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 457 transitions. [2025-03-17 06:13:10,218 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 457 transitions. Word has length 144 [2025-03-17 06:13:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 457 transitions. [2025-03-17 06:13:10,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:13:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 457 transitions. [2025-03-17 06:13:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:10,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:10,219 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:13:10,219 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999684, now seen corresponding path program 1 times [2025-03-17 06:13:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496824348] [2025-03-17 06:13:10,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:10,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:10,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:10,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:10,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496824348] [2025-03-17 06:13:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496824348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:13:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987996342] [2025-03-17 06:13:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:10,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:13:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:13:10,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:13:10,898 INFO L87 Difference]: Start difference. First operand 337 states and 457 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:13:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:11,412 INFO L93 Difference]: Finished difference Result 715 states and 968 transitions. [2025-03-17 06:13:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2025-03-17 06:13:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:11,415 INFO L225 Difference]: With dead ends: 715 [2025-03-17 06:13:11,415 INFO L226 Difference]: Without dead ends: 403 [2025-03-17 06:13:11,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:13:11,417 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 269 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:11,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 324 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:13:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-17 06:13:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 345. [2025-03-17 06:13:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 287 states have (on average 1.278745644599303) internal successors, (367), 291 states have internal predecessors, (367), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 06:13:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 465 transitions. [2025-03-17 06:13:11,482 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 465 transitions. Word has length 144 [2025-03-17 06:13:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:11,482 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 465 transitions. [2025-03-17 06:13:11,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:13:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2025-03-17 06:13:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:11,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:11,483 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:11,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:13:11,483 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:11,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash 470557057, now seen corresponding path program 1 times [2025-03-17 06:13:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222083150] [2025-03-17 06:13:11,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:11,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:11,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:11,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222083150] [2025-03-17 06:13:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222083150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620729800] [2025-03-17 06:13:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:13:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:11,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:13:11,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:11,600 INFO L87 Difference]: Start difference. First operand 345 states and 465 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:13:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:11,777 INFO L93 Difference]: Finished difference Result 710 states and 959 transitions. [2025-03-17 06:13:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:13:11,777 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-03-17 06:13:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:11,779 INFO L225 Difference]: With dead ends: 710 [2025-03-17 06:13:11,779 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 06:13:11,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:11,780 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:11,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 369 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:13:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 06:13:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 350. [2025-03-17 06:13:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 292 states have (on average 1.2773972602739727) internal successors, (373), 296 states have internal predecessors, (373), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 06:13:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 471 transitions. [2025-03-17 06:13:11,846 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 471 transitions. Word has length 144 [2025-03-17 06:13:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 471 transitions. [2025-03-17 06:13:11,846 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:13:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 471 transitions. [2025-03-17 06:13:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:11,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:11,847 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:11,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:13:11,847 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1093657915, now seen corresponding path program 1 times [2025-03-17 06:13:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778522285] [2025-03-17 06:13:11,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:11,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:11,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:11,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:11,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778522285] [2025-03-17 06:13:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778522285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:13:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782344409] [2025-03-17 06:13:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:13:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:12,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:13:12,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:13:12,601 INFO L87 Difference]: Start difference. First operand 350 states and 471 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:13:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:13,165 INFO L93 Difference]: Finished difference Result 712 states and 960 transitions. [2025-03-17 06:13:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 144 [2025-03-17 06:13:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:13,167 INFO L225 Difference]: With dead ends: 712 [2025-03-17 06:13:13,167 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 06:13:13,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:13:13,168 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 342 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:13,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 477 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:13:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 06:13:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2025-03-17 06:13:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 325 states have (on average 1.2676923076923077) internal successors, (412), 330 states have internal predecessors, (412), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:13:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 526 transitions. [2025-03-17 06:13:13,244 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 526 transitions. Word has length 144 [2025-03-17 06:13:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:13,245 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 526 transitions. [2025-03-17 06:13:13,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:13:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 526 transitions. [2025-03-17 06:13:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:13:13,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:13,246 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:13,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:13:13,246 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:13,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 131657662, now seen corresponding path program 1 times [2025-03-17 06:13:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775603907] [2025-03-17 06:13:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:13,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:13:13,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:13:13,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775603907] [2025-03-17 06:13:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775603907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:13:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240703899] [2025-03-17 06:13:14,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:13:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:14,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:13:14,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:13:14,426 INFO L87 Difference]: Start difference. First operand 392 states and 526 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:13:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:15,364 INFO L93 Difference]: Finished difference Result 886 states and 1194 transitions. [2025-03-17 06:13:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:13:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 144 [2025-03-17 06:13:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:15,367 INFO L225 Difference]: With dead ends: 886 [2025-03-17 06:13:15,367 INFO L226 Difference]: Without dead ends: 527 [2025-03-17 06:13:15,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:13:15,368 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 252 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:15,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 734 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:13:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-17 06:13:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 421. [2025-03-17 06:13:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 354 states have (on average 1.2824858757062148) internal successors, (454), 359 states have internal predecessors, (454), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:13:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 568 transitions. [2025-03-17 06:13:15,513 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 568 transitions. Word has length 144 [2025-03-17 06:13:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:15,513 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 568 transitions. [2025-03-17 06:13:15,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 06:13:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 568 transitions. [2025-03-17 06:13:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 06:13:15,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:15,514 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:13:15,514 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1544894762, now seen corresponding path program 1 times [2025-03-17 06:13:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328194164] [2025-03-17 06:13:15,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:13:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:13:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328194164] [2025-03-17 06:13:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328194164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:17,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:13:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857490723] [2025-03-17 06:13:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:17,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:13:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:17,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:13:17,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:13:17,690 INFO L87 Difference]: Start difference. First operand 421 states and 568 transitions. Second operand has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:18,619 INFO L93 Difference]: Finished difference Result 894 states and 1207 transitions. [2025-03-17 06:13:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:13:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 145 [2025-03-17 06:13:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:18,623 INFO L225 Difference]: With dead ends: 894 [2025-03-17 06:13:18,623 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 06:13:18,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:13:18,624 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 369 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 544 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:13:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 06:13:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 458. [2025-03-17 06:13:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 391 states have (on average 1.2838874680306904) internal successors, (502), 396 states have internal predecessors, (502), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:13:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 616 transitions. [2025-03-17 06:13:18,707 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 616 transitions. Word has length 145 [2025-03-17 06:13:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:18,707 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 616 transitions. [2025-03-17 06:13:18,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 06:13:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 616 transitions. [2025-03-17 06:13:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 06:13:18,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:18,709 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:18,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 06:13:18,709 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1246997427, now seen corresponding path program 1 times [2025-03-17 06:13:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220063740] [2025-03-17 06:13:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:13:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:13:18,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:18,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:13:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220063740] [2025-03-17 06:13:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220063740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:13:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846123678] [2025-03-17 06:13:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:19,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:13:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:19,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:13:19,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:13:19,543 INFO L87 Difference]: Start difference. First operand 458 states and 616 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:13:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:20,006 INFO L93 Difference]: Finished difference Result 865 states and 1165 transitions. [2025-03-17 06:13:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:20,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2025-03-17 06:13:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:20,010 INFO L225 Difference]: With dead ends: 865 [2025-03-17 06:13:20,010 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 06:13:20,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:13:20,011 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 254 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:20,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 339 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:13:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 06:13:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2025-03-17 06:13:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 376 states have internal predecessors, (469), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:13:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 583 transitions. [2025-03-17 06:13:20,099 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 583 transitions. Word has length 145 [2025-03-17 06:13:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 583 transitions. [2025-03-17 06:13:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:13:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 583 transitions. [2025-03-17 06:13:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 06:13:20,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:20,100 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 06:13:20,101 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash -52005461, now seen corresponding path program 1 times [2025-03-17 06:13:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602866938] [2025-03-17 06:13:20,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:13:20,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:13:20,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:20,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat