/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 15:44:19,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 15:44:19,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 15:44:19,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 15:44:19,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 15:44:19,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 15:44:19,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 15:44:19,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 15:44:19,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 15:44:19,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 15:44:19,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 15:44:19,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 15:44:19,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 15:44:19,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 15:44:19,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 15:44:19,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 15:44:19,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 15:44:19,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 15:44:19,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 15:44:19,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 15:44:19,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 15:44:19,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 15:44:19,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 15:44:19,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 15:44:19,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 15:44:19,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 15:44:19,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 15:44:19,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 15:44:19,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 15:44:19,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 15:44:19,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 15:44:19,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 15:44:19,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 15:44:19,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 15:44:19,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 15:44:19,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 15:44:19,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 15:44:19,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 15:44:19,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 15:44:19,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 15:44:19,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 15:44:19,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-14 15:44:19,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 15:44:19,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 15:44:19,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-14 15:44:19,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-14 15:44:19,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-14 15:44:19,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-14 15:44:19,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-14 15:44:19,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-14 15:44:19,134 INFO L138 SettingsManager]: * Use SBE=true [2022-02-14 15:44:19,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 15:44:19,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 15:44:19,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 15:44:19,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 15:44:19,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 15:44:19,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 15:44:19,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 15:44:19,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-14 15:44:19,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-14 15:44:19,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-14 15:44:19,138 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-14 15:44:19,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 15:44:19,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 15:44:19,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 15:44:19,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 15:44:19,357 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 15:44:19,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-02-14 15:44:19,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da4c77f6/9d0ef38a5def48a7b75804a47a2e00a0/FLAGf1456ca17 [2022-02-14 15:44:19,738 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 15:44:19,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-02-14 15:44:19,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da4c77f6/9d0ef38a5def48a7b75804a47a2e00a0/FLAGf1456ca17 [2022-02-14 15:44:20,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da4c77f6/9d0ef38a5def48a7b75804a47a2e00a0 [2022-02-14 15:44:20,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 15:44:20,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-14 15:44:20,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 15:44:20,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 15:44:20,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 15:44:20,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1aef0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20, skipping insertion in model container [2022-02-14 15:44:20,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 15:44:20,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 15:44:20,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-02-14 15:44:20,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-02-14 15:44:20,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-02-14 15:44:20,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-02-14 15:44:20,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-02-14 15:44:20,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-02-14 15:44:20,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-02-14 15:44:20,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-02-14 15:44:20,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-02-14 15:44:20,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-02-14 15:44:20,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-02-14 15:44:20,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-02-14 15:44:20,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-02-14 15:44:20,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-02-14 15:44:20,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-02-14 15:44:20,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-02-14 15:44:20,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-02-14 15:44:20,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 15:44:20,366 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 15:44:20,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-02-14 15:44:20,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-02-14 15:44:20,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-02-14 15:44:20,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-02-14 15:44:20,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-02-14 15:44:20,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-02-14 15:44:20,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-02-14 15:44:20,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-02-14 15:44:20,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-02-14 15:44:20,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-02-14 15:44:20,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-02-14 15:44:20,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-02-14 15:44:20,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-02-14 15:44:20,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-02-14 15:44:20,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-02-14 15:44:20,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-02-14 15:44:20,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-02-14 15:44:20,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 15:44:20,422 INFO L208 MainTranslator]: Completed translation [2022-02-14 15:44:20,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20 WrapperNode [2022-02-14 15:44:20,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 15:44:20,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 15:44:20,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 15:44:20,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 15:44:20,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 15:44:20,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 15:44:20,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 15:44:20,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 15:44:20,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (1/1) ... [2022-02-14 15:44:20,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 15:44:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:20,472 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) [2022-02-14 15:44:20,473 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 [2022-02-14 15:44:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 15:44:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 15:44:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 15:44:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-14 15:44:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 15:44:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 15:44:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 15:44:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 15:44:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 15:44:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 15:44:20,598 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 15:44:20,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 15:44:20,819 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 15:44:20,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 15:44:20,824 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-14 15:44:20,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:44:20 BoogieIcfgContainer [2022-02-14 15:44:20,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 15:44:20,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 15:44:20,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 15:44:20,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 15:44:20,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 03:44:20" (1/3) ... [2022-02-14 15:44:20,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69df8163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 03:44:20, skipping insertion in model container [2022-02-14 15:44:20,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:20" (2/3) ... [2022-02-14 15:44:20,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69df8163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 03:44:20, skipping insertion in model container [2022-02-14 15:44:20,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:44:20" (3/3) ... [2022-02-14 15:44:20,835 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-02-14 15:44:20,838 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-14 15:44:20,838 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-14 15:44:20,866 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 15:44:20,870 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 15:44:20,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-02-14 15:44:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 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) [2022-02-14 15:44:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 15:44:20,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-02-14 15:44:20,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674636418] [2022-02-14 15:44:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674636418] [2022-02-14 15:44:21,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674636418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:21,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641811697] [2022-02-14 15:44:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:21,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:21,078 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-02-14 15:44:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,258 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-02-14 15:44:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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 12 [2022-02-14 15:44:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,266 INFO L225 Difference]: With dead ends: 87 [2022-02-14 15:44:21,266 INFO L226 Difference]: Without dead ends: 69 [2022-02-14 15:44:21,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,274 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:21,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-14 15:44:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-14 15:44:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) 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) [2022-02-14 15:44:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-02-14 15:44:21,309 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-02-14 15:44:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,309 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-02-14 15:44:21,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-02-14 15:44:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-14 15:44:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 15:44:21,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 15:44:21,311 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-02-14 15:44:21,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907879736] [2022-02-14 15:44:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907879736] [2022-02-14 15:44:21,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907879736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:21,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343772533] [2022-02-14 15:44:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:21,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:21,403 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-02-14 15:44:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,567 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-14 15:44:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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 12 [2022-02-14 15:44:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,570 INFO L225 Difference]: With dead ends: 111 [2022-02-14 15:44:21,570 INFO L226 Difference]: Without dead ends: 109 [2022-02-14 15:44:21,571 INFO L932 BasicCegarLoop]: 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 [2022-02-14 15:44:21,572 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:21,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-14 15:44:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-02-14 15:44:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) 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) [2022-02-14 15:44:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-14 15:44:21,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-02-14 15:44:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,589 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-14 15:44:21,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-02-14 15:44:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-14 15:44:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-14 15:44:21,589 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 15:44:21,590 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-02-14 15:44:21,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220645064] [2022-02-14 15:44:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220645064] [2022-02-14 15:44:21,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220645064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:21,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038825743] [2022-02-14 15:44:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:21,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:21,689 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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) [2022-02-14 15:44:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,772 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-14 15:44:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 13 [2022-02-14 15:44:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,773 INFO L225 Difference]: With dead ends: 73 [2022-02-14 15:44:21,774 INFO L226 Difference]: Without dead ends: 71 [2022-02-14 15:44:21,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,774 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:21,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-14 15:44:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-14 15:44:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 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) [2022-02-14 15:44:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-02-14 15:44:21,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-02-14 15:44:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,780 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-02-14 15:44:21,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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) [2022-02-14 15:44:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-14 15:44:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 15:44:21,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 15:44:21,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,781 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-02-14 15:44:21,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091805180] [2022-02-14 15:44:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091805180] [2022-02-14 15:44:21,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091805180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:21,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279998711] [2022-02-14 15:44:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:21,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:21,831 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2022-02-14 15:44:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,954 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-14 15:44:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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 15 [2022-02-14 15:44:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,955 INFO L225 Difference]: With dead ends: 71 [2022-02-14 15:44:21,955 INFO L226 Difference]: Without dead ends: 69 [2022-02-14 15:44:21,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:21,956 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:21,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-14 15:44:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-02-14 15:44:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) 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) [2022-02-14 15:44:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-02-14 15:44:21,961 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-02-14 15:44:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,961 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-02-14 15:44:21,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2022-02-14 15:44:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-02-14 15:44:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 15:44:21,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-14 15:44:21,962 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-02-14 15:44:21,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375323252] [2022-02-14 15:44:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375323252] [2022-02-14 15:44:22,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375323252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:22,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805421211] [2022-02-14 15:44:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:22,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:22,029 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2022-02-14 15:44:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,139 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-14 15:44:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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 15 [2022-02-14 15:44:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,140 INFO L225 Difference]: With dead ends: 69 [2022-02-14 15:44:22,140 INFO L226 Difference]: Without dead ends: 67 [2022-02-14 15:44:22,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:22,141 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-14 15:44:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-02-14 15:44:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) 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) [2022-02-14 15:44:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-02-14 15:44:22,145 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-02-14 15:44:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,145 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-02-14 15:44:22,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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) [2022-02-14 15:44:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-02-14 15:44:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:22,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-14 15:44:22,146 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-02-14 15:44:22,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399436765] [2022-02-14 15:44:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399436765] [2022-02-14 15:44:22,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399436765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:22,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059229452] [2022-02-14 15:44:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:22,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:22,183 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,249 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-14 15:44:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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 16 [2022-02-14 15:44:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,250 INFO L225 Difference]: With dead ends: 67 [2022-02-14 15:44:22,250 INFO L226 Difference]: Without dead ends: 63 [2022-02-14 15:44:22,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:22,251 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-14 15:44:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-02-14 15:44:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 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) [2022-02-14 15:44:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-02-14 15:44:22,255 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-02-14 15:44:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,255 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-02-14 15:44:22,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-02-14 15:44:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:22,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-14 15:44:22,256 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-02-14 15:44:22,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743649859] [2022-02-14 15:44:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743649859] [2022-02-14 15:44:22,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743649859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:22,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186388394] [2022-02-14 15:44:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:22,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:22,299 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,430 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-02-14 15:44:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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 16 [2022-02-14 15:44:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,431 INFO L225 Difference]: With dead ends: 104 [2022-02-14 15:44:22,432 INFO L226 Difference]: Without dead ends: 102 [2022-02-14 15:44:22,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:22,432 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-14 15:44:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-02-14 15:44:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 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) [2022-02-14 15:44:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-02-14 15:44:22,436 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-02-14 15:44:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,436 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-02-14 15:44:22,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-14 15:44:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:22,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-14 15:44:22,437 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-02-14 15:44:22,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497010677] [2022-02-14 15:44:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497010677] [2022-02-14 15:44:22,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497010677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:22,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357241830] [2022-02-14 15:44:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:22,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:22,470 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,526 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-14 15:44:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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 16 [2022-02-14 15:44:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,527 INFO L225 Difference]: With dead ends: 61 [2022-02-14 15:44:22,528 INFO L226 Difference]: Without dead ends: 57 [2022-02-14 15:44:22,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:22,529 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-14 15:44:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-02-14 15:44:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 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) [2022-02-14 15:44:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-02-14 15:44:22,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-02-14 15:44:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,541 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-02-14 15:44:22,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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) [2022-02-14 15:44:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-02-14 15:44:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:22,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-14 15:44:22,544 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-02-14 15:44:22,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424697306] [2022-02-14 15:44:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424697306] [2022-02-14 15:44:22,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424697306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:22,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358642349] [2022-02-14 15:44:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:22,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:22,607 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,698 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-14 15:44:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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 17 [2022-02-14 15:44:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,699 INFO L225 Difference]: With dead ends: 74 [2022-02-14 15:44:22,699 INFO L226 Difference]: Without dead ends: 72 [2022-02-14 15:44:22,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:22,699 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-14 15:44:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-02-14 15:44:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 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) [2022-02-14 15:44:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-02-14 15:44:22,703 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-02-14 15:44:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,703 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-02-14 15:44:22,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-02-14 15:44:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:22,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-14 15:44:22,704 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-02-14 15:44:22,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16230590] [2022-02-14 15:44:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16230590] [2022-02-14 15:44:22,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16230590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:22,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141422231] [2022-02-14 15:44:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:22,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:22,739 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,807 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-14 15:44:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:22,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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 17 [2022-02-14 15:44:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,809 INFO L225 Difference]: With dead ends: 55 [2022-02-14 15:44:22,809 INFO L226 Difference]: Without dead ends: 53 [2022-02-14 15:44:22,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:22,813 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-14 15:44:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-02-14 15:44:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 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) [2022-02-14 15:44:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-14 15:44:22,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-02-14 15:44:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,817 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-14 15:44:22,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-14 15:44:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:22,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-14 15:44:22,818 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-02-14 15:44:22,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660102031] [2022-02-14 15:44:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660102031] [2022-02-14 15:44:22,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660102031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:22,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:22,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:22,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729294700] [2022-02-14 15:44:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:22,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:22,890 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,051 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-02-14 15:44:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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 17 [2022-02-14 15:44:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,052 INFO L225 Difference]: With dead ends: 110 [2022-02-14 15:44:23,052 INFO L226 Difference]: Without dead ends: 108 [2022-02-14 15:44:23,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:23,053 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-14 15:44:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-02-14 15:44:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 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) [2022-02-14 15:44:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-02-14 15:44:23,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-02-14 15:44:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,057 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-02-14 15:44:23,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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) [2022-02-14 15:44:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-02-14 15:44:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:23,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-14 15:44:23,057 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-02-14 15:44:23,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030442103] [2022-02-14 15:44:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030442103] [2022-02-14 15:44:23,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030442103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:23,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109201503] [2022-02-14 15:44:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:23,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:23,090 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,182 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-14 15:44:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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 18 [2022-02-14 15:44:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,183 INFO L225 Difference]: With dead ends: 77 [2022-02-14 15:44:23,183 INFO L226 Difference]: Without dead ends: 75 [2022-02-14 15:44:23,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:23,183 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-14 15:44:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-02-14 15:44:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 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) [2022-02-14 15:44:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-02-14 15:44:23,187 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-02-14 15:44:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,187 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-02-14 15:44:23,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-02-14 15:44:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:23,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-14 15:44:23,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-02-14 15:44:23,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068409879] [2022-02-14 15:44:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068409879] [2022-02-14 15:44:23,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068409879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:23,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924650780] [2022-02-14 15:44:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:23,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:23,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:23,250 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,370 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-02-14 15:44:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:23,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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 18 [2022-02-14 15:44:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,371 INFO L225 Difference]: With dead ends: 92 [2022-02-14 15:44:23,372 INFO L226 Difference]: Without dead ends: 90 [2022-02-14 15:44:23,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:23,372 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 167 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-14 15:44:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-02-14 15:44:23,376 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) [2022-02-14 15:44:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-02-14 15:44:23,376 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-02-14 15:44:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,376 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-02-14 15:44:23,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-02-14 15:44:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:23,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-14 15:44:23,379 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-02-14 15:44:23,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561194122] [2022-02-14 15:44:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561194122] [2022-02-14 15:44:23,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561194122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:23,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748990397] [2022-02-14 15:44:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:23,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:23,458 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,563 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-02-14 15:44:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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 18 [2022-02-14 15:44:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,564 INFO L225 Difference]: With dead ends: 76 [2022-02-14 15:44:23,564 INFO L226 Difference]: Without dead ends: 72 [2022-02-14 15:44:23,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:23,564 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-14 15:44:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-02-14 15:44:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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) [2022-02-14 15:44:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-02-14 15:44:23,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-02-14 15:44:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,569 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-02-14 15:44:23,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-02-14 15:44:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:23,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-14 15:44:23,572 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-02-14 15:44:23,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011688803] [2022-02-14 15:44:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011688803] [2022-02-14 15:44:23,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011688803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:23,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764714991] [2022-02-14 15:44:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:23,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:23,651 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,747 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-14 15:44:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 15:44:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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 18 [2022-02-14 15:44:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,748 INFO L225 Difference]: With dead ends: 72 [2022-02-14 15:44:23,748 INFO L226 Difference]: Without dead ends: 70 [2022-02-14 15:44:23,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-14 15:44:23,749 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 96 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-14 15:44:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-02-14 15:44:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) 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) [2022-02-14 15:44:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-02-14 15:44:23,752 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-02-14 15:44:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,752 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-02-14 15:44:23,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-02-14 15:44:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-14 15:44:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 15:44:23,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-14 15:44:23,753 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-02-14 15:44:23,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127725966] [2022-02-14 15:44:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127725966] [2022-02-14 15:44:23,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127725966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:23,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30156413] [2022-02-14 15:44:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:23,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:23,810 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 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) [2022-02-14 15:44:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,935 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-02-14 15:44:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:23,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 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 19 [2022-02-14 15:44:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,936 INFO L225 Difference]: With dead ends: 91 [2022-02-14 15:44:23,936 INFO L226 Difference]: Without dead ends: 89 [2022-02-14 15:44:23,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:23,936 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-14 15:44:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-02-14 15:44:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 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) [2022-02-14 15:44:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-02-14 15:44:23,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-02-14 15:44:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,940 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-02-14 15:44:23,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 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) [2022-02-14 15:44:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-02-14 15:44:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 15:44:23,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-14 15:44:23,941 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-02-14 15:44:23,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690232848] [2022-02-14 15:44:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690232848] [2022-02-14 15:44:23,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690232848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:23,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627318740] [2022-02-14 15:44:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:23,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:23,969 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 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) [2022-02-14 15:44:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:24,017 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-02-14 15:44:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 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 20 [2022-02-14 15:44:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:24,018 INFO L225 Difference]: With dead ends: 67 [2022-02-14 15:44:24,018 INFO L226 Difference]: Without dead ends: 65 [2022-02-14 15:44:24,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:24,018 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:24,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-14 15:44:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-14 15:44:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 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) [2022-02-14 15:44:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-02-14 15:44:24,022 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-02-14 15:44:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:24,022 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-02-14 15:44:24,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 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) [2022-02-14 15:44:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-14 15:44:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-14 15:44:24,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:24,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:24,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-14 15:44:24,023 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-02-14 15:44:24,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:24,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452294157] [2022-02-14 15:44:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:24,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:24,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452294157] [2022-02-14 15:44:24,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452294157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:24,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:24,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:24,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825736065] [2022-02-14 15:44:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:24,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:24,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:24,059 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2022-02-14 15:44:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:24,108 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-14 15:44:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:24,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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 [2022-02-14 15:44:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:24,109 INFO L225 Difference]: With dead ends: 65 [2022-02-14 15:44:24,109 INFO L226 Difference]: Without dead ends: 61 [2022-02-14 15:44:24,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:24,109 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:24,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-14 15:44:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-14 15:44:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 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) [2022-02-14 15:44:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-02-14 15:44:24,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-02-14 15:44:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:24,113 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-02-14 15:44:24,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2022-02-14 15:44:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-02-14 15:44:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 15:44:24,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:24,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:24,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-14 15:44:24,114 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-02-14 15:44:24,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:24,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075804756] [2022-02-14 15:44:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:24,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:24,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075804756] [2022-02-14 15:44:24,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075804756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:24,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:24,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:24,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237651721] [2022-02-14 15:44:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:24,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:24,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:24,159 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 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) [2022-02-14 15:44:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:24,271 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-02-14 15:44:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 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 [2022-02-14 15:44:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:24,272 INFO L225 Difference]: With dead ends: 76 [2022-02-14 15:44:24,272 INFO L226 Difference]: Without dead ends: 74 [2022-02-14 15:44:24,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-14 15:44:24,273 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:24,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 67 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-14 15:44:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-02-14 15:44:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 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) [2022-02-14 15:44:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-02-14 15:44:24,277 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-02-14 15:44:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:24,277 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-02-14 15:44:24,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 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) [2022-02-14 15:44:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-02-14 15:44:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 15:44:24,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:24,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:24,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-14 15:44:24,277 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-02-14 15:44:24,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:24,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315783217] [2022-02-14 15:44:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:24,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:24,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315783217] [2022-02-14 15:44:24,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315783217] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 15:44:24,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879508102] [2022-02-14 15:44:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:24,340 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) [2022-02-14 15:44:24,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-14 15:44:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:24,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 15:44:24,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 15:44:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:24,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 15:44:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 15:44:24,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879508102] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 15:44:24,779 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 15:44:24,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-02-14 15:44:24,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780517365] [2022-02-14 15:44:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 15:44:24,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 15:44:24,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 15:44:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-14 15:44:24,780 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:24,985 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-02-14 15:44:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-14 15:44:24,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-14 15:44:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:24,985 INFO L225 Difference]: With dead ends: 102 [2022-02-14 15:44:24,986 INFO L226 Difference]: Without dead ends: 100 [2022-02-14 15:44:24,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-02-14 15:44:24,987 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 335 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:24,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 100 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-14 15:44:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-02-14 15:44:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 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) [2022-02-14 15:44:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-02-14 15:44:24,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-02-14 15:44:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:24,995 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-02-14 15:44:24,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-14 15:44:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 15:44:24,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:24,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:25,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-14 15:44:25,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:25,199 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-02-14 15:44:25,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:25,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057170042] [2022-02-14 15:44:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:25,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:25,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057170042] [2022-02-14 15:44:25,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057170042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:25,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:25,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:25,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864119645] [2022-02-14 15:44:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:25,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:25,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:25,248 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2022-02-14 15:44:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:25,344 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-14 15:44:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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 23 [2022-02-14 15:44:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:25,345 INFO L225 Difference]: With dead ends: 64 [2022-02-14 15:44:25,345 INFO L226 Difference]: Without dead ends: 62 [2022-02-14 15:44:25,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-14 15:44:25,345 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:25,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 52 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-14 15:44:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-02-14 15:44:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 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) [2022-02-14 15:44:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-02-14 15:44:25,349 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-02-14 15:44:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:25,350 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-02-14 15:44:25,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2022-02-14 15:44:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-14 15:44:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 15:44:25,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:25,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:25,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-14 15:44:25,350 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-02-14 15:44:25,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:25,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865726455] [2022-02-14 15:44:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:25,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:25,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865726455] [2022-02-14 15:44:25,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865726455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:25,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:25,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:25,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781029569] [2022-02-14 15:44:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:25,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:25,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:25,396 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2022-02-14 15:44:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:25,483 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-14 15:44:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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 23 [2022-02-14 15:44:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:25,484 INFO L225 Difference]: With dead ends: 47 [2022-02-14 15:44:25,484 INFO L226 Difference]: Without dead ends: 24 [2022-02-14 15:44:25,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-14 15:44:25,485 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:25,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 47 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-14 15:44:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-14 15:44:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) [2022-02-14 15:44:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-02-14 15:44:25,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-02-14 15:44:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:25,489 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-02-14 15:44:25,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 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) [2022-02-14 15:44:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-14 15:44:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 15:44:25,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:25,489 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:25,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-14 15:44:25,489 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-14 15:44:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-02-14 15:44:25,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:25,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498166364] [2022-02-14 15:44:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:25,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:25,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498166364] [2022-02-14 15:44:25,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498166364] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 15:44:25,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757461313] [2022-02-14 15:44:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:25,552 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) [2022-02-14 15:44:25,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-14 15:44:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:25,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 15:44:25,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 15:44:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:25,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 15:44:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 15:44:25,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757461313] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 15:44:25,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 15:44:25,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-02-14 15:44:25,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011127093] [2022-02-14 15:44:25,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 15:44:25,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 15:44:25,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 15:44:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-14 15:44:25,811 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:25,886 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-14 15:44:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 15:44:25,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-14 15:44:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:25,886 INFO L225 Difference]: With dead ends: 35 [2022-02-14 15:44:25,886 INFO L226 Difference]: Without dead ends: 0 [2022-02-14 15:44:25,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-14 15:44:25,887 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:25,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-14 15:44:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-14 15:44:25,887 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) [2022-02-14 15:44:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-14 15:44:25,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-02-14 15:44:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:25,888 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-14 15:44:25,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-14 15:44:25,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-14 15:44:25,889 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-02-14 15:44:25,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-02-14 15:44:25,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-02-14 15:44:25,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-02-14 15:44:25,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-02-14 15:44:25,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-02-14 15:44:25,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-02-14 15:44:25,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 15:44:26,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-02-14 15:44:26,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-14 15:46:46,762 WARN L228 SmtUtils]: Spent 2.34m on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-14 15:46:54,983 WARN L228 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 86 DAG size of output: 87 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-14 15:46:55,523 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L854 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-02-14 15:46:55,524 INFO L858 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-02-14 15:46:55,525 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L854 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse2 (<= main_~main__t~0 1))) (let ((.cse0 (let ((.cse4 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse4 (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0))) (and .cse4 (not (= main_~__VERIFIER_assert__cond~17 0)))))) (.cse1 (<= 1 main_~main__t~0)) (.cse3 (< main_~main__t~0 main_~main__tagbuf_len~0))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1) (and .cse2 .cse3 .cse0 .cse1) (and .cse3 (= main_~main__t~0 0))))) [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L854 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (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)) [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-02-14 15:46:55,526 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-02-14 15:46:55,527 INFO L858 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L854 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L854 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1) (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(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|)) [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-14 15:46:55,528 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-14 15:46:55,528 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-14 15:46:55,528 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-14 15:46:55,530 INFO L732 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] [2022-02-14 15:46:55,531 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-14 15:46:55,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 03:46:55 BoogieIcfgContainer [2022-02-14 15:46:55,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-14 15:46:55,556 INFO L158 Benchmark]: Toolchain (without parser) took 155384.83ms. Allocated memory was 181.4MB in the beginning and 532.7MB in the end (delta: 351.3MB). Free memory was 125.6MB in the beginning and 441.3MB in the end (delta: -315.7MB). Peak memory consumption was 295.7MB. Max. memory is 8.0GB. [2022-02-14 15:46:55,557 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-14 15:46:55,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.14ms. Allocated memory was 181.4MB in the beginning and 249.6MB in the end (delta: 68.2MB). Free memory was 125.4MB in the beginning and 214.5MB in the end (delta: -89.1MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-02-14 15:46:55,557 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 249.6MB. Free memory was 214.5MB in the beginning and 212.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-14 15:46:55,557 INFO L158 Benchmark]: RCFGBuilder took 379.10ms. Allocated memory is still 249.6MB. Free memory was 212.8MB in the beginning and 198.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-14 15:46:55,557 INFO L158 Benchmark]: TraceAbstraction took 154729.22ms. Allocated memory was 249.6MB in the beginning and 532.7MB in the end (delta: 283.1MB). Free memory was 197.8MB in the beginning and 441.3MB in the end (delta: -243.5MB). Peak memory consumption was 300.1MB. Max. memory is 8.0GB. [2022-02-14 15:46:55,558 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.11ms. Allocated memory is still 181.4MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.14ms. Allocated memory was 181.4MB in the beginning and 249.6MB in the end (delta: 68.2MB). Free memory was 125.4MB in the beginning and 214.5MB in the end (delta: -89.1MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 249.6MB. Free memory was 214.5MB in the beginning and 212.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.10ms. Allocated memory is still 249.6MB. Free memory was 212.8MB in the beginning and 198.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 154729.22ms. Allocated memory was 249.6MB in the beginning and 532.7MB in the end (delta: 283.1MB). Free memory was 197.8MB in the beginning and 441.3MB in the end (delta: -243.5MB). Peak memory consumption was 300.1MB. 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, 83 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 154.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 149.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1635 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1635 mSDsluCounter, 2714 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1688 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3171 IncrementalHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1026 mSDtfsCounter, 3171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 329 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 212 HoareAnnotationTreeSize, 9 FomulaSimplifications, 222349 FormulaSimplificationTreeSizeReduction, 148.9s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2542155 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2171 SizeOfPredicates, 6 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 20 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && main__t == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || ((1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((1 <= __VERIFIER_assert__cond && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) && !(main__tagbuf_len == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (((main__t <= 1 && main__t < main__tagbuf_len) && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) && !(main__tagbuf_len == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t)) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t RESULT: Ultimate proved your program to be correct! [2022-02-14 15:46:55,596 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...