/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 22:08:38,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 22:08:38,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 22:08:38,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 22:08:38,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 22:08:38,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 22:08:38,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 22:08:38,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 22:08:38,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 22:08:38,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 22:08:38,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 22:08:38,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 22:08:38,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 22:08:38,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 22:08:38,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 22:08:38,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 22:08:38,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 22:08:38,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 22:08:38,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 22:08:38,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 22:08:38,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 22:08:38,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 22:08:38,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 22:08:38,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 22:08:38,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 22:08:38,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 22:08:38,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 22:08:38,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 22:08:38,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 22:08:38,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 22:08:38,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 22:08:38,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 22:08:38,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 22:08:38,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 22:08:38,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 22:08:38,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 22:08:38,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 22:08:38,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 22:08:38,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 22:08:38,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 22:08:38,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 22:08:38,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 22:08:38,669 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 22:08:38,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 22:08:38,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 22:08:38,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 22:08:38,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 22:08:38,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 22:08:38,671 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 22:08:38,671 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 22:08:38,671 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 22:08:38,671 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 22:08:38,671 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 22:08:38,671 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 22:08:38,672 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 22:08:38,672 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 22:08:38,672 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 22:08:38,672 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 22:08:38,672 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 22:08:38,672 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 22:08:38,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 22:08:38,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 22:08:38,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:08:38,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 22:08:38,674 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 22:08:38,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 22:08:38,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 22:08:38,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 22:08:38,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 22:08:38,892 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 22:08:38,892 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 22:08:38,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-04-02 22:08:39,831 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 22:08:40,001 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 22:08:40,001 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-04-02 22:08:40,009 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25e644d0/3e82ad15e9704bf39a9268cb64421152/FLAG6e4e5f518 [2023-04-02 22:08:40,027 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25e644d0/3e82ad15e9704bf39a9268cb64421152 [2023-04-02 22:08:40,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 22:08:40,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 22:08:40,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 22:08:40,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 22:08:40,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 22:08:40,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b26114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40, skipping insertion in model container [2023-04-02 22:08:40,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 22:08:40,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 22:08:40,155 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-04-02 22:08:40,158 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-04-02 22:08:40,160 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-04-02 22:08:40,165 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-04-02 22:08:40,166 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-04-02 22:08:40,167 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-04-02 22:08:40,168 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-04-02 22:08:40,169 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-04-02 22:08:40,170 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-04-02 22:08:40,171 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-04-02 22:08:40,172 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-04-02 22:08:40,173 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-04-02 22:08:40,174 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-04-02 22:08:40,176 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-04-02 22:08:40,176 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-04-02 22:08:40,179 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-04-02 22:08:40,180 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-04-02 22:08:40,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:08:40,191 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 22:08:40,199 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-04-02 22:08:40,200 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-04-02 22:08:40,201 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-04-02 22:08:40,202 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-04-02 22:08:40,203 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-04-02 22:08:40,203 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-04-02 22:08:40,204 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-04-02 22:08:40,205 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-04-02 22:08:40,206 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-04-02 22:08:40,207 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-04-02 22:08:40,208 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-04-02 22:08:40,209 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-04-02 22:08:40,210 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-04-02 22:08:40,211 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-04-02 22:08:40,212 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-04-02 22:08:40,213 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-04-02 22:08:40,213 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-04-02 22:08:40,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:08:40,223 INFO L208 MainTranslator]: Completed translation [2023-04-02 22:08:40,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40 WrapperNode [2023-04-02 22:08:40,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 22:08:40,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 22:08:40,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 22:08:40,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 22:08:40,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 22:08:40,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 22:08:40,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 22:08:40,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 22:08:40,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (1/1) ... [2023-04-02 22:08:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:08:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:08:40,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 22:08:40,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 22:08:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 22:08:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 22:08:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 22:08:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 22:08:40,393 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 22:08:40,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 22:08:40,650 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 22:08:40,670 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 22:08:40,670 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-02 22:08:40,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:08:40 BoogieIcfgContainer [2023-04-02 22:08:40,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 22:08:40,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 22:08:40,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 22:08:40,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 22:08:40,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 10:08:40" (1/3) ... [2023-04-02 22:08:40,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7251b1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:08:40, skipping insertion in model container [2023-04-02 22:08:40,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:08:40" (2/3) ... [2023-04-02 22:08:40,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7251b1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:08:40, skipping insertion in model container [2023-04-02 22:08:40,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:08:40" (3/3) ... [2023-04-02 22:08:40,677 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2023-04-02 22:08:40,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 22:08:40,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-04-02 22:08:40,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 22:08:40,741 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@20894bfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 22:08:40,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-04-02 22:08:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 22:08:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-02 22:08:40,749 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:40,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:40,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:40,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash 405849098, now seen corresponding path program 1 times [2023-04-02 22:08:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629309203] [2023-04-02 22:08:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:40,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629309203] [2023-04-02 22:08:40,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629309203] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:40,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:40,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899381965] [2023-04-02 22:08:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:40,974 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,048 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2023-04-02 22:08:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:08:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-02 22:08:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:41,061 INFO L225 Difference]: With dead ends: 84 [2023-04-02 22:08:41,061 INFO L226 Difference]: Without dead ends: 68 [2023-04-02 22:08:41,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:41,068 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 116 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:41,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-04-02 22:08:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-04-02 22:08:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-04-02 22:08:41,115 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2023-04-02 22:08:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:41,115 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-04-02 22:08:41,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-04-02 22:08:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-02 22:08:41,116 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:41,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 22:08:41,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:41,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash 409083404, now seen corresponding path program 1 times [2023-04-02 22:08:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522927839] [2023-04-02 22:08:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:41,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:41,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522927839] [2023-04-02 22:08:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522927839] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632964167] [2023-04-02 22:08:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:41,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:41,274 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,361 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-04-02 22:08:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-02 22:08:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:41,365 INFO L225 Difference]: With dead ends: 110 [2023-04-02 22:08:41,365 INFO L226 Difference]: Without dead ends: 108 [2023-04-02 22:08:41,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:41,366 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:41,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 213 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:08:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-04-02 22:08:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2023-04-02 22:08:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-04-02 22:08:41,377 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2023-04-02 22:08:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:41,378 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-04-02 22:08:41,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-04-02 22:08:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 22:08:41,378 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:41,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:41,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 22:08:41,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:41,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash -303576780, now seen corresponding path program 1 times [2023-04-02 22:08:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:41,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380312165] [2023-04-02 22:08:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:41,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380312165] [2023-04-02 22:08:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380312165] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:41,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817849003] [2023-04-02 22:08:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:41,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:41,465 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,517 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-04-02 22:08:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 22:08:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:41,519 INFO L225 Difference]: With dead ends: 72 [2023-04-02 22:08:41,520 INFO L226 Difference]: Without dead ends: 70 [2023-04-02 22:08:41,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:41,522 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:41,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 124 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-04-02 22:08:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-04-02 22:08:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-04-02 22:08:41,542 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2023-04-02 22:08:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:41,542 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-04-02 22:08:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-04-02 22:08:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 22:08:41,543 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:41,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 22:08:41,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:41,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash 320587000, now seen corresponding path program 1 times [2023-04-02 22:08:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452080216] [2023-04-02 22:08:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:41,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452080216] [2023-04-02 22:08:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452080216] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600548639] [2023-04-02 22:08:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:41,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:41,658 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,717 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-04-02 22:08:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-02 22:08:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:41,721 INFO L225 Difference]: With dead ends: 70 [2023-04-02 22:08:41,721 INFO L226 Difference]: Without dead ends: 68 [2023-04-02 22:08:41,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:41,723 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:41,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-04-02 22:08:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2023-04-02 22:08:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-04-02 22:08:41,739 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2023-04-02 22:08:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:41,739 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-04-02 22:08:41,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-04-02 22:08:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 22:08:41,740 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:41,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:41,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 22:08:41,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:41,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2110468640, now seen corresponding path program 1 times [2023-04-02 22:08:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789275480] [2023-04-02 22:08:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:41,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789275480] [2023-04-02 22:08:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789275480] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649117864] [2023-04-02 22:08:41,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:41,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:41,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:41,827 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,890 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-04-02 22:08:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:41,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-02 22:08:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:41,891 INFO L225 Difference]: With dead ends: 68 [2023-04-02 22:08:41,891 INFO L226 Difference]: Without dead ends: 66 [2023-04-02 22:08:41,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:41,892 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:41,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-02 22:08:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-04-02 22:08:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-04-02 22:08:41,898 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2023-04-02 22:08:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:41,898 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-04-02 22:08:41,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-04-02 22:08:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:08:41,899 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:41,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:41,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 22:08:41,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:41,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1348265494, now seen corresponding path program 1 times [2023-04-02 22:08:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895687948] [2023-04-02 22:08:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:41,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895687948] [2023-04-02 22:08:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895687948] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944696665] [2023-04-02 22:08:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:41,963 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:41,999 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-04-02 22:08:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:08:41,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-02 22:08:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,000 INFO L225 Difference]: With dead ends: 66 [2023-04-02 22:08:42,000 INFO L226 Difference]: Without dead ends: 62 [2023-04-02 22:08:42,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,001 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-02 22:08:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-04-02 22:08:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-04-02 22:08:42,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2023-04-02 22:08:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,012 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-04-02 22:08:42,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-04-02 22:08:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:08:42,013 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 22:08:42,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -999585229, now seen corresponding path program 1 times [2023-04-02 22:08:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531477461] [2023-04-02 22:08:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531477461] [2023-04-02 22:08:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531477461] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137921624] [2023-04-02 22:08:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:42,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,067 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,127 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-04-02 22:08:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-02 22:08:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,128 INFO L225 Difference]: With dead ends: 103 [2023-04-02 22:08:42,128 INFO L226 Difference]: Without dead ends: 101 [2023-04-02 22:08:42,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,129 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 95 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 153 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-02 22:08:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 59. [2023-04-02 22:08:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-04-02 22:08:42,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2023-04-02 22:08:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,136 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-04-02 22:08:42,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-04-02 22:08:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 22:08:42,139 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 22:08:42,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1000015212, now seen corresponding path program 1 times [2023-04-02 22:08:42,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42628694] [2023-04-02 22:08:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42628694] [2023-04-02 22:08:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42628694] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318308637] [2023-04-02 22:08:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:42,178 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,206 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-04-02 22:08:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:08:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-02 22:08:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,207 INFO L225 Difference]: With dead ends: 60 [2023-04-02 22:08:42,207 INFO L226 Difference]: Without dead ends: 56 [2023-04-02 22:08:42,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,208 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 121 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-04-02 22:08:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2023-04-02 22:08:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-04-02 22:08:42,210 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2023-04-02 22:08:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,211 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-04-02 22:08:42,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-04-02 22:08:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-02 22:08:42,213 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 22:08:42,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1139220310, now seen corresponding path program 1 times [2023-04-02 22:08:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392426236] [2023-04-02 22:08:42,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392426236] [2023-04-02 22:08:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392426236] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163751492] [2023-04-02 22:08:42,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,261 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,309 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2023-04-02 22:08:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-04-02 22:08:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,310 INFO L225 Difference]: With dead ends: 73 [2023-04-02 22:08:42,310 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 22:08:42,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,312 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 69 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 112 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 22:08:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2023-04-02 22:08:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-04-02 22:08:42,316 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2023-04-02 22:08:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,316 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-04-02 22:08:42,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-04-02 22:08:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-02 22:08:42,317 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 22:08:42,317 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1137681110, now seen corresponding path program 1 times [2023-04-02 22:08:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034559141] [2023-04-02 22:08:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034559141] [2023-04-02 22:08:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034559141] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155393657] [2023-04-02 22:08:42,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,376 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,418 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-04-02 22:08:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-04-02 22:08:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,419 INFO L225 Difference]: With dead ends: 54 [2023-04-02 22:08:42,419 INFO L226 Difference]: Without dead ends: 52 [2023-04-02 22:08:42,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,420 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 86 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-02 22:08:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-04-02 22:08:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-04-02 22:08:42,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2023-04-02 22:08:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,424 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-04-02 22:08:42,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-04-02 22:08:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-02 22:08:42,425 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 22:08:42,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -922367820, now seen corresponding path program 1 times [2023-04-02 22:08:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405857028] [2023-04-02 22:08:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405857028] [2023-04-02 22:08:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405857028] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274257478] [2023-04-02 22:08:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,523 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,597 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-04-02 22:08:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 22:08:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-04-02 22:08:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,598 INFO L225 Difference]: With dead ends: 109 [2023-04-02 22:08:42,598 INFO L226 Difference]: Without dead ends: 107 [2023-04-02 22:08:42,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-02 22:08:42,598 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 71 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 182 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:08:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-04-02 22:08:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 56. [2023-04-02 22:08:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-04-02 22:08:42,614 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2023-04-02 22:08:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,614 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-04-02 22:08:42,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-04-02 22:08:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:08:42,615 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-02 22:08:42,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -954722715, now seen corresponding path program 1 times [2023-04-02 22:08:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334552382] [2023-04-02 22:08:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334552382] [2023-04-02 22:08:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334552382] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:08:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111359957] [2023-04-02 22:08:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:08:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:08:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:42,674 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,724 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-04-02 22:08:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-02 22:08:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,725 INFO L225 Difference]: With dead ends: 76 [2023-04-02 22:08:42,725 INFO L226 Difference]: Without dead ends: 74 [2023-04-02 22:08:42,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,726 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 60 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 104 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-02 22:08:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2023-04-02 22:08:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-04-02 22:08:42,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2023-04-02 22:08:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,730 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-04-02 22:08:42,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-04-02 22:08:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:08:42,731 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-04-02 22:08:42,731 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -956088135, now seen corresponding path program 1 times [2023-04-02 22:08:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100667767] [2023-04-02 22:08:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100667767] [2023-04-02 22:08:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100667767] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231007105] [2023-04-02 22:08:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,808 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,872 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-04-02 22:08:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 22:08:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-02 22:08:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,874 INFO L225 Difference]: With dead ends: 91 [2023-04-02 22:08:42,874 INFO L226 Difference]: Without dead ends: 89 [2023-04-02 22:08:42,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-02 22:08:42,875 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 128 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-04-02 22:08:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2023-04-02 22:08:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 55 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-04-02 22:08:42,880 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 17 [2023-04-02 22:08:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:42,880 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-04-02 22:08:42,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-04-02 22:08:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:08:42,881 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:42,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:42,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-04-02 22:08:42,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:42,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -908372885, now seen corresponding path program 1 times [2023-04-02 22:08:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506058077] [2023-04-02 22:08:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:42,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506058077] [2023-04-02 22:08:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506058077] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476483880] [2023-04-02 22:08:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:42,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:42,944 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:42,997 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2023-04-02 22:08:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 22:08:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-02 22:08:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:42,998 INFO L225 Difference]: With dead ends: 75 [2023-04-02 22:08:42,998 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 22:08:42,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-02 22:08:42,998 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:42,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 22:08:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-04-02 22:08:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-04-02 22:08:43,005 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 17 [2023-04-02 22:08:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,005 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-04-02 22:08:43,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-04-02 22:08:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:08:43,006 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-04-02 22:08:43,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1465122711, now seen corresponding path program 1 times [2023-04-02 22:08:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812040374] [2023-04-02 22:08:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812040374] [2023-04-02 22:08:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812040374] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:43,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123866404] [2023-04-02 22:08:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:43,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:43,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:43,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:43,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:43,101 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:43,151 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-04-02 22:08:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:08:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-02 22:08:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:43,152 INFO L225 Difference]: With dead ends: 71 [2023-04-02 22:08:43,152 INFO L226 Difference]: Without dead ends: 69 [2023-04-02 22:08:43,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-02 22:08:43,152 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:43,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 90 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-04-02 22:08:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2023-04-02 22:08:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-04-02 22:08:43,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2023-04-02 22:08:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,159 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-04-02 22:08:43,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-04-02 22:08:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 22:08:43,159 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-04-02 22:08:43,160 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash 468370045, now seen corresponding path program 1 times [2023-04-02 22:08:43,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469805075] [2023-04-02 22:08:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469805075] [2023-04-02 22:08:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469805075] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716739512] [2023-04-02 22:08:43,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:43,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:43,257 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:43,318 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-04-02 22:08:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 22:08:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-04-02 22:08:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:43,319 INFO L225 Difference]: With dead ends: 90 [2023-04-02 22:08:43,319 INFO L226 Difference]: Without dead ends: 88 [2023-04-02 22:08:43,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-02 22:08:43,320 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:43,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 156 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-02 22:08:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2023-04-02 22:08:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2023-04-02 22:08:43,326 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 18 [2023-04-02 22:08:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,327 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2023-04-02 22:08:43,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2023-04-02 22:08:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-02 22:08:43,328 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-02 22:08:43,329 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 322400252, now seen corresponding path program 1 times [2023-04-02 22:08:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897984109] [2023-04-02 22:08:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897984109] [2023-04-02 22:08:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897984109] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428229110] [2023-04-02 22:08:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:43,366 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:43,384 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-04-02 22:08:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:08:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-04-02 22:08:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:43,386 INFO L225 Difference]: With dead ends: 66 [2023-04-02 22:08:43,386 INFO L226 Difference]: Without dead ends: 64 [2023-04-02 22:08:43,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:43,386 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:43,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-02 22:08:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-04-02 22:08:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2023-04-02 22:08:43,391 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 19 [2023-04-02 22:08:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,391 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2023-04-02 22:08:43,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2023-04-02 22:08:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 22:08:43,391 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-04-02 22:08:43,392 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1404476342, now seen corresponding path program 1 times [2023-04-02 22:08:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743284627] [2023-04-02 22:08:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743284627] [2023-04-02 22:08:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743284627] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:43,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:08:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051492426] [2023-04-02 22:08:43,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:43,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:08:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:08:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:08:43,426 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:43,453 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-04-02 22:08:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:08:43,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-04-02 22:08:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:43,454 INFO L225 Difference]: With dead ends: 64 [2023-04-02 22:08:43,454 INFO L226 Difference]: Without dead ends: 60 [2023-04-02 22:08:43,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:08:43,455 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:43,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-02 22:08:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-04-02 22:08:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-04-02 22:08:43,462 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 20 [2023-04-02 22:08:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,462 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-04-02 22:08:43,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-04-02 22:08:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 22:08:43,462 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-04-02 22:08:43,463 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 602333904, now seen corresponding path program 1 times [2023-04-02 22:08:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077478372] [2023-04-02 22:08:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077478372] [2023-04-02 22:08:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077478372] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:43,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633317192] [2023-04-02 22:08:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:43,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:43,534 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:43,586 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2023-04-02 22:08:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 22:08:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-02 22:08:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:43,587 INFO L225 Difference]: With dead ends: 75 [2023-04-02 22:08:43,587 INFO L226 Difference]: Without dead ends: 73 [2023-04-02 22:08:43,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-04-02 22:08:43,587 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 56 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-04-02 22:08:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2023-04-02 22:08:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-04-02 22:08:43,592 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2023-04-02 22:08:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:43,592 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-04-02 22:08:43,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-04-02 22:08:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 22:08:43,592 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:43,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-04-02 22:08:43,593 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:43,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -10743632, now seen corresponding path program 1 times [2023-04-02 22:08:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377028347] [2023-04-02 22:08:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377028347] [2023-04-02 22:08:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377028347] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:08:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978607956] [2023-04-02 22:08:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:43,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:08:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:08:43,658 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) [2023-04-02 22:08:43,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 22:08:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:43,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-02 22:08:43,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:08:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:43,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:08:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:08:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978607956] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:08:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [941195634] [2023-04-02 22:08:43,936 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-02 22:08:43,937 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:08:43,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:08:43,942 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:08:43,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:08:44,017 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-04-02 22:08:44,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2023-04-02 22:08:44,516 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:08:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [941195634] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:45,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:08:45,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [7, 9, 8] total 31 [2023-04-02 22:08:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827146024] [2023-04-02 22:08:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:45,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 22:08:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 22:08:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2023-04-02 22:08:45,253 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:46,491 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2023-04-02 22:08:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 22:08:46,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-02 22:08:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:46,492 INFO L225 Difference]: With dead ends: 55 [2023-04-02 22:08:46,492 INFO L226 Difference]: Without dead ends: 53 [2023-04-02 22:08:46,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=416, Invalid=1224, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 22:08:46,493 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:46,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:08:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-02 22:08:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-04-02 22:08:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-04-02 22:08:46,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 21 [2023-04-02 22:08:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:46,498 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-04-02 22:08:46,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-04-02 22:08:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 22:08:46,498 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:46,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:46,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 22:08:46,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:08:46,704 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:46,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 800624694, now seen corresponding path program 1 times [2023-04-02 22:08:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063809036] [2023-04-02 22:08:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:46,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063809036] [2023-04-02 22:08:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063809036] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:46,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:46,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208292189] [2023-04-02 22:08:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:46,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:46,766 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:46,814 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-04-02 22:08:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 22:08:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-02 22:08:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:46,814 INFO L225 Difference]: With dead ends: 63 [2023-04-02 22:08:46,814 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 22:08:46,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-04-02 22:08:46,815 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 84 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:46,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 46 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 22:08:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2023-04-02 22:08:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-04-02 22:08:46,819 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2023-04-02 22:08:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:46,819 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-04-02 22:08:46,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-04-02 22:08:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 22:08:46,820 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:46,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:46,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-04-02 22:08:46,820 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:46,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 848339944, now seen corresponding path program 1 times [2023-04-02 22:08:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724467809] [2023-04-02 22:08:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:46,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724467809] [2023-04-02 22:08:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724467809] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:46,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:08:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 22:08:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160483698] [2023-04-02 22:08:46,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 22:08:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 22:08:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:08:46,875 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:46,916 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-04-02 22:08:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:08:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-02 22:08:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:46,917 INFO L225 Difference]: With dead ends: 46 [2023-04-02 22:08:46,917 INFO L226 Difference]: Without dead ends: 23 [2023-04-02 22:08:46,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-02 22:08:46,917 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:08:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-02 22:08:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-02 22:08:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-04-02 22:08:46,920 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2023-04-02 22:08:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:46,920 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-04-02 22:08:46,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-04-02 22:08:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 22:08:46,921 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:08:46,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-04-02 22:08:46,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-04-02 22:08:46,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:08:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -339298533, now seen corresponding path program 1 times [2023-04-02 22:08:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:08:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305653595] [2023-04-02 22:08:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:08:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:46,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:08:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305653595] [2023-04-02 22:08:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305653595] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:08:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909096716] [2023-04-02 22:08:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:08:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:08:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:08:46,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:08:47,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 22:08:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:08:47,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-02 22:08:47,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:08:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 22:08:47,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:08:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:08:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909096716] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:08:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [409099620] [2023-04-02 22:08:47,218 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 22:08:47,218 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:08:47,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:08:47,218 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:08:47,218 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:08:47,244 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-04-02 22:08:47,535 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2023-04-02 22:08:47,540 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:08:48,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [409099620] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:08:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 22:08:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [7, 9, 8] total 34 [2023-04-02 22:08:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782908817] [2023-04-02 22:08:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:08:48,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 22:08:48,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:08:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 22:08:48,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 22:08:48,536 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 19 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:08:49,751 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2023-04-02 22:08:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 22:08:49,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-02 22:08:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:08:49,751 INFO L225 Difference]: With dead ends: 23 [2023-04-02 22:08:49,751 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 22:08:49,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=442, Invalid=1450, Unknown=0, NotChecked=0, Total=1892 [2023-04-02 22:08:49,753 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:08:49,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:08:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 22:08:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 22:08:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-02 22:08:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 22:08:49,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-04-02 22:08:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:08:49,753 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 22:08:49,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 22:08:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 22:08:49,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 22:08:49,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2023-04-02 22:08:49,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2023-04-02 22:08:49,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2023-04-02 22:08:49,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2023-04-02 22:08:49,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2023-04-02 22:08:49,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2023-04-02 22:08:49,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2023-04-02 22:08:49,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 22:08:49,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-04-02 22:08:49,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-04-02 22:08:52,715 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L895 garLoopResultBuilder]: At program point L168(lines 102 252) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (not (= |#NULL.base| 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2023-04-02 22:08:52,716 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L895 garLoopResultBuilder]: At program point L285(lines 283 364) the Hoare annotation is: (let ((.cse9 (select |#memory_int| 1)) (.cse0 (= main_~main____CPAchecker_TMP_0~0 0)) (.cse1 (= main_~__VERIFIER_assert__cond~13 1)) (.cse2 (= ~__return_305~0 0)) (.cse3 (= main_~__tmp_14~0 1)) (.cse4 (= main_~__VERIFIER_assert__cond~12 1)) (.cse5 (<= main_~main__tagbuf_len~0 2147483646)) (.cse6 (= ~__tmp_247_0~0 0)) (.cse7 (= main_~__tmp_13~0 1)) (.cse8 (= ~__tmp_383_0~0 0))) (or (and (= main_~__VERIFIER_assert__cond~16 1) (= main_~main____CPAchecker_TMP_0~1 0) (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1 (= main_~__VERIFIER_assert__cond~17 1) .cse2 .cse3 (= main_~__tmp_17~0 1) .cse4 (= main_~__tmp_18~0 1) (= (+ main_~main____CPAchecker_TMP_1~0 1) main_~main__t~0) .cse5 .cse6 (<= 1 main_~main__t~0) .cse7 .cse8) (not (= (select .cse9 0) 48)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse9 1) 0)) (and (= main_~main__t~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< 0 main_~main__tagbuf_len~0) .cse7 .cse8) (not (= (select |#valid| 1) 1)) (not (= |#NULL.base| 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2023-04-02 22:08:52,717 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 375) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (not (= |#NULL.base| 0)) (and (= ~__return_305~0 0) (= ~__tmp_247_0~0 0) (= ~__tmp_383_0~0 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,717 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L895 garLoopResultBuilder]: At program point $Ultimate##12(lines 64 253) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= (select |#valid| 1) 1)) (not (= |#NULL.base| 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2023-04-02 22:08:52,718 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L895 garLoopResultBuilder]: At program point L90(lines 32 368) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (<= 0 main_~main__t~0) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (not (= |#NULL.base| 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2023-04-02 22:08:52,719 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L895 garLoopResultBuilder]: At program point L35(lines 32 368) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1)) (.cse1 (< main_~main__t~0 main_~main__tagbuf_len~0))) (or (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= |old(~__tmp_383_0~0)| 0)) (not (= 2 (select |#length| 1))) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0)) (not (= (select |#valid| 3) 1)) (not (= ~__return_main~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (<= main_~main____CPAchecker_TMP_0~1 2147483647) .cse1 (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__VERIFIER_assert__cond~13 1) (= ~__return_305~0 0) (= main_~__tmp_14~0 1) (= main_~__VERIFIER_assert__cond~12 1) (= (+ main_~main____CPAchecker_TMP_1~0 1) main_~main__t~0) (<= main_~main__tagbuf_len~0 2147483646) (= main_~main____CPAchecker_TMP_0~1 ~__tmp_247_0~0) (<= 0 main_~main____CPAchecker_TMP_1~0) (<= 0 (+ main_~main____CPAchecker_TMP_0~1 2147483648)) (= main_~__tmp_13~0 1) (= ~__tmp_383_0~0 0)) (not (= (select |#valid| 1) 1)) (and (<= main_~main__t~0 1) (not (= main_~__VERIFIER_assert__cond~13 0)) .cse1 (<= 1 main_~main__t~0)) (not (= |#NULL.base| 0)) (not (= |old(~__tmp_247_0~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~__return_305~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= 33 (select |#length| 2))))) [2023-04-02 22:08:52,720 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~__return_305~0 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~__tmp_247_0~0 0) (= (select .cse0 0) 48) (= 33 (select |#length| 2)) (= (select .cse0 1) 0) (= ~__return_main~0 0) (= ~__tmp_383_0~0 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-02 22:08:52,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 22:08:52,720 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 22:08:52,723 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:08:52,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 22:08:52,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 10:08:52 BoogieIcfgContainer [2023-04-02 22:08:52,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 22:08:52,758 INFO L158 Benchmark]: Toolchain (without parser) took 12728.58ms. Allocated memory was 299.9MB in the beginning and 433.1MB in the end (delta: 133.2MB). Free memory was 254.3MB in the beginning and 229.4MB in the end (delta: 24.9MB). Peak memory consumption was 252.0MB. Max. memory is 8.0GB. [2023-04-02 22:08:52,758 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 22:08:52,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.32ms. Allocated memory is still 299.9MB. Free memory was 254.3MB in the beginning and 237.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 22:08:52,759 INFO L158 Benchmark]: Boogie Preprocessor took 28.26ms. Allocated memory is still 299.9MB. Free memory was 237.6MB in the beginning and 236.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 22:08:52,759 INFO L158 Benchmark]: RCFGBuilder took 419.57ms. Allocated memory is still 299.9MB. Free memory was 236.0MB in the beginning and 218.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-04-02 22:08:52,759 INFO L158 Benchmark]: TraceAbstraction took 12084.50ms. Allocated memory was 299.9MB in the beginning and 433.1MB in the end (delta: 133.2MB). Free memory was 217.6MB in the beginning and 229.4MB in the end (delta: -11.8MB). Peak memory consumption was 215.3MB. Max. memory is 8.0GB. [2023-04-02 22:08:52,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.32ms. Allocated memory is still 299.9MB. Free memory was 254.3MB in the beginning and 237.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.26ms. Allocated memory is still 299.9MB. Free memory was 237.6MB in the beginning and 236.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 419.57ms. Allocated memory is still 299.9MB. Free memory was 236.0MB in the beginning and 218.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12084.50ms. Allocated memory was 299.9MB in the beginning and 433.1MB in the end (delta: 133.2MB). Free memory was 217.6MB in the beginning and 229.4MB in the end (delta: -11.8MB). Peak memory consumption was 215.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1208 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1208 mSDsluCounter, 2422 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1446 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1741 IncrementalHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 976 mSDtfsCounter, 1741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 283 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 814 HoareAnnotationTreeSize, 9 FomulaSimplifications, 383375 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1647 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 1666 SizeOfPredicates, 12 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 34, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 49, TOOLS_POST_TIME: 0.4s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 61, TOOLS_QUANTIFIERELIM_TIME: 0.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 110, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.4s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 34, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 304, DAG_COMPRESSION_RETAINED_NODES: 114, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((!(unknown-#memory_int-unknown[1][0] == 48) || !(#NULL == 0)) || !(\old(__tmp_383_0) == 0)) || !(2 == unknown-#length-unknown[1])) || 0 <= main__t) || !(\valid[3] == 1)) || !(__return_main == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(\valid[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_247_0) == 0)) || !(\valid[2] == 1)) || !(\old(__return_305) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(33 == unknown-#length-unknown[2]) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((!(unknown-#memory_int-unknown[1][0] == 48) || !(#NULL == 0)) || !(\old(__tmp_383_0) == 0)) || !(2 == unknown-#length-unknown[1])) || !(\valid[3] == 1)) || !(__return_main == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len)) || !(\valid[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_247_0) == 0)) || !(\valid[2] == 1)) || !(\old(__return_305) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(33 == unknown-#length-unknown[2]) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((__VERIFIER_assert__cond == 1 && main____CPAchecker_TMP_0 == 0) && main__t < main__tagbuf_len) && main____CPAchecker_TMP_0 == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __return_305 == 0) && __tmp_14 == 1) && __tmp_17 == 1) && __VERIFIER_assert__cond == 1) && __tmp_18 == 1) && main____CPAchecker_TMP_1 + 1 == main__t) && main__tagbuf_len <= 2147483646) && __tmp_247_0 == 0) && 1 <= main__t) && __tmp_13 == 1) && __tmp_383_0 == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(\old(__tmp_383_0) == 0)) || !(2 == unknown-#length-unknown[1])) || !(\valid[3] == 1)) || !(__return_main == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || ((((((((((main__t == 0 && main____CPAchecker_TMP_0 == 0) && __VERIFIER_assert__cond == 1) && __return_305 == 0) && __tmp_14 == 1) && __VERIFIER_assert__cond == 1) && main__tagbuf_len <= 2147483646) && __tmp_247_0 == 0) && 0 < main__tagbuf_len) && __tmp_13 == 1) && __tmp_383_0 == 0)) || !(\valid[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_247_0) == 0)) || !(\valid[2] == 1)) || !(\old(__return_305) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(33 == unknown-#length-unknown[2]) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((!(unknown-#memory_int-unknown[1][0] == 48) || !(#NULL == 0)) || !(\old(__tmp_383_0) == 0)) || !(2 == unknown-#length-unknown[1])) || (main__t == 0 && 0 < main__tagbuf_len)) || !(\valid[3] == 1)) || !(__return_main == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || (((((((((((((((!(main____CPAchecker_TMP_0 == 0) && !(__VERIFIER_assert__cond == 0)) && main____CPAchecker_TMP_0 <= 2147483647) && main__t < main__tagbuf_len) && main____CPAchecker_TMP_0 == 0) && __VERIFIER_assert__cond == 1) && __return_305 == 0) && __tmp_14 == 1) && __VERIFIER_assert__cond == 1) && main____CPAchecker_TMP_1 + 1 == main__t) && main__tagbuf_len <= 2147483646) && main____CPAchecker_TMP_0 == __tmp_247_0) && 0 <= main____CPAchecker_TMP_1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && __tmp_13 == 1) && __tmp_383_0 == 0)) || !(\valid[1] == 1)) || (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && 1 <= main__t)) || !(#NULL == 0)) || !(\old(__tmp_247_0) == 0)) || !(\valid[2] == 1)) || !(\old(__return_305) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(33 == unknown-#length-unknown[2]) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((!(unknown-#memory_int-unknown[1][0] == 48) || !(#NULL == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && 1 <= main__t)) || !(\old(__tmp_383_0) == 0)) || !(2 == unknown-#length-unknown[1])) || !(\valid[3] == 1)) || !(__return_main == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(\valid[1] == 1)) || !(#NULL == 0)) || !(\old(__tmp_247_0) == 0)) || !(\valid[2] == 1)) || !(\old(__return_305) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(33 == unknown-#length-unknown[2]) RESULT: Ultimate proved your program to be correct! [2023-04-02 22:08:52,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...