/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 07:47:17,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 07:47:17,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 07:47:17,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 07:47:17,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 07:47:17,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 07:47:17,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 07:47:17,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 07:47:17,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 07:47:17,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 07:47:17,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 07:47:17,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 07:47:17,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 07:47:17,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 07:47:17,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 07:47:17,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 07:47:17,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 07:47:17,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 07:47:17,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 07:47:17,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 07:47:17,219 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 07:47:17,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 07:47:17,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 07:47:17,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 07:47:17,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 07:47:17,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 07:47:17,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 07:47:17,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 07:47:17,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 07:47:17,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 07:47:17,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 07:47:17,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 07:47:17,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 07:47:17,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 07:47:17,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 07:47:17,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 07:47:17,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 07:47:17,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 07:47:17,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 07:47:17,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 07:47:17,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 07:47:17,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 07:47:17,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-19 07:47:17,240 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 07:47:17,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 07:47:17,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 07:47:17,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 07:47:17,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 07:47:17,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 07:47:17,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 07:47:17,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 07:47:17,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 07:47:17,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 07:47:17,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-19 07:47:17,243 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-03-19 07:47:17,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 07:47:17,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 07:47:17,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 07:47:17,460 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 07:47:17,460 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 07:47:17,461 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+lhb-reducer.c [2022-03-19 07:47:17,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec72623ec/6aecfc90e4634a63b37b277103f79a57/FLAGa14c91752 [2022-03-19 07:47:17,926 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 07:47:17,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-03-19 07:47:17,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec72623ec/6aecfc90e4634a63b37b277103f79a57/FLAGa14c91752 [2022-03-19 07:47:18,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec72623ec/6aecfc90e4634a63b37b277103f79a57 [2022-03-19 07:47:18,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 07:47:18,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 07:47:18,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 07:47:18,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 07:47:18,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 07:47:18,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c6f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18, skipping insertion in model container [2022-03-19 07:47:18,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 07:47:18,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 07:47:18,523 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+lhb-reducer.c[1224,1237] [2022-03-19 07:47:18,527 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+lhb-reducer.c[1636,1649] [2022-03-19 07:47:18,528 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+lhb-reducer.c[1851,1864] [2022-03-19 07:47:18,530 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+lhb-reducer.c[2384,2397] [2022-03-19 07:47:18,532 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+lhb-reducer.c[2599,2612] [2022-03-19 07:47:18,533 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+lhb-reducer.c[2901,2914] [2022-03-19 07:47:18,534 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+lhb-reducer.c[3116,3129] [2022-03-19 07:47:18,541 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+lhb-reducer.c[3386,3399] [2022-03-19 07:47:18,545 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+lhb-reducer.c[3604,3617] [2022-03-19 07:47:18,547 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+lhb-reducer.c[4088,4101] [2022-03-19 07:47:18,548 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+lhb-reducer.c[4306,4319] [2022-03-19 07:47:18,550 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+lhb-reducer.c[4802,4815] [2022-03-19 07:47:18,551 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+lhb-reducer.c[5203,5216] [2022-03-19 07:47:18,552 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+lhb-reducer.c[5421,5434] [2022-03-19 07:47:18,553 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+lhb-reducer.c[5792,5805] [2022-03-19 07:47:18,554 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+lhb-reducer.c[6010,6023] [2022-03-19 07:47:18,559 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+lhb-reducer.c[6296,6309] [2022-03-19 07:47:18,563 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+lhb-reducer.c[6514,6527] [2022-03-19 07:47:18,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 07:47:18,582 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 07:47:18,608 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+lhb-reducer.c[1224,1237] [2022-03-19 07:47:18,609 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+lhb-reducer.c[1636,1649] [2022-03-19 07:47:18,610 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+lhb-reducer.c[1851,1864] [2022-03-19 07:47:18,611 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+lhb-reducer.c[2384,2397] [2022-03-19 07:47:18,612 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+lhb-reducer.c[2599,2612] [2022-03-19 07:47:18,613 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+lhb-reducer.c[2901,2914] [2022-03-19 07:47:18,614 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+lhb-reducer.c[3116,3129] [2022-03-19 07:47:18,615 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+lhb-reducer.c[3386,3399] [2022-03-19 07:47:18,617 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+lhb-reducer.c[3604,3617] [2022-03-19 07:47:18,618 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+lhb-reducer.c[4088,4101] [2022-03-19 07:47:18,620 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+lhb-reducer.c[4306,4319] [2022-03-19 07:47:18,621 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+lhb-reducer.c[4802,4815] [2022-03-19 07:47:18,623 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+lhb-reducer.c[5203,5216] [2022-03-19 07:47:18,624 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+lhb-reducer.c[5421,5434] [2022-03-19 07:47:18,625 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+lhb-reducer.c[5792,5805] [2022-03-19 07:47:18,625 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+lhb-reducer.c[6010,6023] [2022-03-19 07:47:18,626 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+lhb-reducer.c[6296,6309] [2022-03-19 07:47:18,634 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+lhb-reducer.c[6514,6527] [2022-03-19 07:47:18,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 07:47:18,647 INFO L208 MainTranslator]: Completed translation [2022-03-19 07:47:18,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18 WrapperNode [2022-03-19 07:47:18,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 07:47:18,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 07:47:18,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 07:47:18,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 07:47:18,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 07:47:18,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 07:47:18,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 07:47:18,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 07:47:18,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (1/1) ... [2022-03-19 07:47:18,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 07:47:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 07:47:18,716 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-03-19 07:47:18,743 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-03-19 07:47:18,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 07:47:18,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 07:47:18,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 07:47:18,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 07:47:18,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 07:47:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 07:47:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 07:47:18,849 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 07:47:18,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 07:47:19,105 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 07:47:19,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 07:47:19,115 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 07:47:19,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 07:47:19 BoogieIcfgContainer [2022-03-19 07:47:19,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 07:47:19,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 07:47:19,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 07:47:19,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 07:47:19,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 07:47:18" (1/3) ... [2022-03-19 07:47:19,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5b484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 07:47:19, skipping insertion in model container [2022-03-19 07:47:19,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 07:47:18" (2/3) ... [2022-03-19 07:47:19,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5b484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 07:47:19, skipping insertion in model container [2022-03-19 07:47:19,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 07:47:19" (3/3) ... [2022-03-19 07:47:19,125 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-03-19 07:47:19,129 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 07:47:19,129 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-19 07:47:19,168 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 07:47:19,173 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-19 07:47:19,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-03-19 07:47:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-03-19 07:47:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 07:47:19,192 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:19,192 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:19,193 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-03-19 07:47:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:19,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728598590] [2022-03-19 07:47:19,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 2 times [2022-03-19 07:47:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:19,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568806730] [2022-03-19 07:47:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:19,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568806730] [2022-03-19 07:47:19,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568806730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:19,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:19,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:19,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:19,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728598590] [2022-03-19 07:47:19,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728598590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:19,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:19,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881448210] [2022-03-19 07:47:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:19,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:19,458 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-03-19 07:47:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:19,713 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-03-19 07:47:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 07:47:19,716 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-03-19 07:47:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:19,725 INFO L225 Difference]: With dead ends: 129 [2022-03-19 07:47:19,725 INFO L226 Difference]: Without dead ends: 111 [2022-03-19 07:47:19,731 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 07:47:19,744 INFO L912 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:19,745 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 07:47:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-19 07:47:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-03-19 07:47:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 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-03-19 07:47:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-03-19 07:47:19,774 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-03-19 07:47:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:19,775 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-03-19 07:47:19,775 INFO L479 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-03-19 07:47:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-03-19 07:47:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 07:47:19,776 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:19,776 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:19,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 07:47:19,776 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:19,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-03-19 07:47:19,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:19,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906976815] [2022-03-19 07:47:19,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 2 times [2022-03-19 07:47:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988911603] [2022-03-19 07:47:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988911603] [2022-03-19 07:47:19,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988911603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:19,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:19,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:19,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:19,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906976815] [2022-03-19 07:47:19,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906976815] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:19,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:19,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838054804] [2022-03-19 07:47:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:19,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:19,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:19,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:19,871 INFO L87 Difference]: Start difference. First operand 73 states and 77 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-03-19 07:47:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:20,089 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-03-19 07:47:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 07:47:20,090 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-03-19 07:47:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:20,094 INFO L225 Difference]: With dead ends: 111 [2022-03-19 07:47:20,094 INFO L226 Difference]: Without dead ends: 109 [2022-03-19 07:47:20,095 INFO L911 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-03-19 07:47:20,104 INFO L912 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:20,104 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 07:47:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-19 07:47:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-03-19 07:47:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 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-03-19 07:47:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-03-19 07:47:20,127 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-03-19 07:47:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:20,127 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-03-19 07:47:20,127 INFO L479 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-03-19 07:47:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-03-19 07:47:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 07:47:20,129 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:20,129 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:20,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 07:47:20,129 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-03-19 07:47:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [907178323] [2022-03-19 07:47:20,131 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 2 times [2022-03-19 07:47:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:20,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923177236] [2022-03-19 07:47:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923177236] [2022-03-19 07:47:20,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923177236] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [907178323] [2022-03-19 07:47:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [907178323] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452406187] [2022-03-19 07:47:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:20,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:20,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:20,220 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-03-19 07:47:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:20,355 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-03-19 07:47:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:20,355 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-03-19 07:47:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:20,356 INFO L225 Difference]: With dead ends: 73 [2022-03-19 07:47:20,356 INFO L226 Difference]: Without dead ends: 71 [2022-03-19 07:47:20,357 INFO L911 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-03-19 07:47:20,357 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 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-03-19 07:47:20,358 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-19 07:47:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-03-19 07:47:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-03-19 07:47:20,367 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-03-19 07:47:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:20,367 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-03-19 07:47:20,367 INFO L479 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-03-19 07:47:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-03-19 07:47:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 07:47:20,368 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:20,368 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:20,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 07:47:20,368 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-03-19 07:47:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453258448] [2022-03-19 07:47:20,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 2 times [2022-03-19 07:47:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:20,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034957240] [2022-03-19 07:47:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:20,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034957240] [2022-03-19 07:47:20,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034957240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:20,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453258448] [2022-03-19 07:47:20,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453258448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122452900] [2022-03-19 07:47:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:20,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:20,426 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-03-19 07:47:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:20,551 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-03-19 07:47:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:20,551 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-03-19 07:47:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:20,552 INFO L225 Difference]: With dead ends: 71 [2022-03-19 07:47:20,552 INFO L226 Difference]: Without dead ends: 69 [2022-03-19 07:47:20,552 INFO L911 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-03-19 07:47:20,553 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 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-03-19 07:47:20,554 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-19 07:47:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-03-19 07:47:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-03-19 07:47:20,574 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-03-19 07:47:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:20,574 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-03-19 07:47:20,575 INFO L479 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-03-19 07:47:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-03-19 07:47:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 07:47:20,575 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:20,575 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:20,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 07:47:20,576 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-03-19 07:47:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678252687] [2022-03-19 07:47:20,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 2 times [2022-03-19 07:47:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121999045] [2022-03-19 07:47:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:20,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121999045] [2022-03-19 07:47:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121999045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:20,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678252687] [2022-03-19 07:47:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678252687] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957427766] [2022-03-19 07:47:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:20,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:20,681 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-03-19 07:47:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:20,782 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-03-19 07:47:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 07:47:20,782 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-03-19 07:47:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:20,784 INFO L225 Difference]: With dead ends: 69 [2022-03-19 07:47:20,784 INFO L226 Difference]: Without dead ends: 65 [2022-03-19 07:47:20,785 INFO L911 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-03-19 07:47:20,787 INFO L912 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:20,787 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-19 07:47:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-03-19 07:47:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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-03-19 07:47:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-03-19 07:47:20,798 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-03-19 07:47:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:20,803 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-03-19 07:47:20,803 INFO L479 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-03-19 07:47:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-03-19 07:47:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 07:47:20,804 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:20,804 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:20,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 07:47:20,805 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-03-19 07:47:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579565863] [2022-03-19 07:47:20,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 2 times [2022-03-19 07:47:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:20,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162682205] [2022-03-19 07:47:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162682205] [2022-03-19 07:47:20,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162682205] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:20,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579565863] [2022-03-19 07:47:20,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579565863] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:20,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:20,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184787809] [2022-03-19 07:47:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:20,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:20,869 INFO L87 Difference]: Start difference. First operand 63 states and 67 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-03-19 07:47:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:21,044 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-03-19 07:47:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:21,044 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-03-19 07:47:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:21,046 INFO L225 Difference]: With dead ends: 108 [2022-03-19 07:47:21,046 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 07:47:21,046 INFO L911 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-03-19 07:47:21,048 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:21,048 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 07:47:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-03-19 07:47:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-03-19 07:47:21,070 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-03-19 07:47:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:21,071 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-03-19 07:47:21,071 INFO L479 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-03-19 07:47:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-03-19 07:47:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 07:47:21,074 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:21,074 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:21,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 07:47:21,074 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-03-19 07:47:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655189258] [2022-03-19 07:47:21,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 2 times [2022-03-19 07:47:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:21,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372232911] [2022-03-19 07:47:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372232911] [2022-03-19 07:47:21,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372232911] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655189258] [2022-03-19 07:47:21,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655189258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750610908] [2022-03-19 07:47:21,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:21,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:21,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:21,152 INFO L87 Difference]: Start difference. First operand 61 states and 65 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-03-19 07:47:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:21,290 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-03-19 07:47:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:21,290 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-03-19 07:47:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:21,291 INFO L225 Difference]: With dead ends: 93 [2022-03-19 07:47:21,291 INFO L226 Difference]: Without dead ends: 91 [2022-03-19 07:47:21,292 INFO L911 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-03-19 07:47:21,292 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:21,293 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-19 07:47:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-03-19 07:47:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-03-19 07:47:21,300 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-03-19 07:47:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:21,301 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-03-19 07:47:21,301 INFO L479 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-03-19 07:47:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-03-19 07:47:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 07:47:21,301 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:21,301 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:21,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 07:47:21,302 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-03-19 07:47:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812028700] [2022-03-19 07:47:21,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 2 times [2022-03-19 07:47:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:21,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939961644] [2022-03-19 07:47:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:21,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939961644] [2022-03-19 07:47:21,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939961644] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:21,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:21,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812028700] [2022-03-19 07:47:21,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812028700] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597524361] [2022-03-19 07:47:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:21,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:21,350 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-03-19 07:47:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:21,426 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-03-19 07:47:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 07:47:21,426 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-03-19 07:47:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:21,427 INFO L225 Difference]: With dead ends: 61 [2022-03-19 07:47:21,427 INFO L226 Difference]: Without dead ends: 57 [2022-03-19 07:47:21,427 INFO L911 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-03-19 07:47:21,428 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:21,428 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-19 07:47:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-03-19 07:47:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-03-19 07:47:21,435 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-03-19 07:47:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:21,435 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-03-19 07:47:21,435 INFO L479 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-03-19 07:47:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-03-19 07:47:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 07:47:21,436 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:21,436 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:21,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 07:47:21,436 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-03-19 07:47:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979314381] [2022-03-19 07:47:21,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 2 times [2022-03-19 07:47:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931146459] [2022-03-19 07:47:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:21,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931146459] [2022-03-19 07:47:21,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931146459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:21,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979314381] [2022-03-19 07:47:21,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979314381] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677728338] [2022-03-19 07:47:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:21,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:21,492 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-03-19 07:47:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:21,603 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-03-19 07:47:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:21,604 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-03-19 07:47:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:21,604 INFO L225 Difference]: With dead ends: 74 [2022-03-19 07:47:21,604 INFO L226 Difference]: Without dead ends: 72 [2022-03-19 07:47:21,605 INFO L911 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-03-19 07:47:21,607 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:21,607 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-19 07:47:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-03-19 07:47:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-03-19 07:47:21,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-03-19 07:47:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:21,616 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-03-19 07:47:21,616 INFO L479 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-03-19 07:47:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-03-19 07:47:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 07:47:21,617 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:21,617 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:21,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 07:47:21,617 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-03-19 07:47:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628067295] [2022-03-19 07:47:21,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 2 times [2022-03-19 07:47:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:21,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688797439] [2022-03-19 07:47:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:21,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688797439] [2022-03-19 07:47:21,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688797439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628067295] [2022-03-19 07:47:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628067295] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020353066] [2022-03-19 07:47:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:21,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:21,681 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-03-19 07:47:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:21,771 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-03-19 07:47:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:21,771 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-03-19 07:47:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:21,772 INFO L225 Difference]: With dead ends: 55 [2022-03-19 07:47:21,772 INFO L226 Difference]: Without dead ends: 53 [2022-03-19 07:47:21,772 INFO L911 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-03-19 07:47:21,773 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:21,774 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-19 07:47:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-03-19 07:47:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-03-19 07:47:21,780 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-03-19 07:47:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:21,781 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-03-19 07:47:21,781 INFO L479 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-03-19 07:47:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-03-19 07:47:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 07:47:21,782 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:21,782 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:21,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 07:47:21,783 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-03-19 07:47:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59707664] [2022-03-19 07:47:21,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 2 times [2022-03-19 07:47:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377239650] [2022-03-19 07:47:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:21,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377239650] [2022-03-19 07:47:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377239650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:21,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59707664] [2022-03-19 07:47:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59707664] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:21,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858722833] [2022-03-19 07:47:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:21,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:21,941 INFO L87 Difference]: Start difference. First operand 51 states and 55 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-03-19 07:47:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:22,096 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-03-19 07:47:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:22,097 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-03-19 07:47:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:22,097 INFO L225 Difference]: With dead ends: 110 [2022-03-19 07:47:22,097 INFO L226 Difference]: Without dead ends: 108 [2022-03-19 07:47:22,098 INFO L911 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-03-19 07:47:22,098 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:22,099 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-19 07:47:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-03-19 07:47:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-03-19 07:47:22,110 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-03-19 07:47:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:22,110 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-03-19 07:47:22,110 INFO L479 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-03-19 07:47:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-03-19 07:47:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 07:47:22,112 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:22,112 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:22,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 07:47:22,113 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-03-19 07:47:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267624346] [2022-03-19 07:47:22,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 2 times [2022-03-19 07:47:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:22,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290002364] [2022-03-19 07:47:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:22,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290002364] [2022-03-19 07:47:22,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290002364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:22,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267624346] [2022-03-19 07:47:22,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267624346] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273672049] [2022-03-19 07:47:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:22,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:22,221 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-03-19 07:47:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:22,379 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-03-19 07:47:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:22,379 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-03-19 07:47:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:22,380 INFO L225 Difference]: With dead ends: 108 [2022-03-19 07:47:22,380 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 07:47:22,381 INFO L911 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-03-19 07:47:22,381 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 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-03-19 07:47:22,381 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 07:47:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-03-19 07:47:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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-03-19 07:47:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-03-19 07:47:22,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-03-19 07:47:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:22,394 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-03-19 07:47:22,394 INFO L479 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-03-19 07:47:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-03-19 07:47:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 07:47:22,395 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:22,395 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:22,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 07:47:22,396 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-03-19 07:47:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191876558] [2022-03-19 07:47:22,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 2 times [2022-03-19 07:47:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303450973] [2022-03-19 07:47:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:22,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303450973] [2022-03-19 07:47:22,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303450973] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:22,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191876558] [2022-03-19 07:47:22,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191876558] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 07:47:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661920724] [2022-03-19 07:47:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:22,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 07:47:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 07:47:22,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 07:47:22,454 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-03-19 07:47:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:22,576 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-03-19 07:47:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 07:47:22,577 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-03-19 07:47:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:22,577 INFO L225 Difference]: With dead ends: 79 [2022-03-19 07:47:22,577 INFO L226 Difference]: Without dead ends: 77 [2022-03-19 07:47:22,578 INFO L911 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-03-19 07:47:22,579 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:22,579 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-19 07:47:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-03-19 07:47:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-03-19 07:47:22,589 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-03-19 07:47:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:22,590 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-03-19 07:47:22,590 INFO L479 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-03-19 07:47:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-03-19 07:47:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 07:47:22,590 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:22,591 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:22,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 07:47:22,591 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-03-19 07:47:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12717492] [2022-03-19 07:47:22,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 2 times [2022-03-19 07:47:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:22,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370909027] [2022-03-19 07:47:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370909027] [2022-03-19 07:47:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370909027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12717492] [2022-03-19 07:47:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12717492] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403187344] [2022-03-19 07:47:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:22,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:22,677 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-03-19 07:47:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:22,814 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-03-19 07:47:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:22,815 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-03-19 07:47:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:22,816 INFO L225 Difference]: With dead ends: 90 [2022-03-19 07:47:22,816 INFO L226 Difference]: Without dead ends: 88 [2022-03-19 07:47:22,817 INFO L911 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-03-19 07:47:22,818 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:22,818 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-19 07:47:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-03-19 07:47:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-03-19 07:47:22,830 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-03-19 07:47:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:22,831 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-03-19 07:47:22,831 INFO L479 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-03-19 07:47:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-03-19 07:47:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 07:47:22,832 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:22,832 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:22,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 07:47:22,832 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-03-19 07:47:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225859733] [2022-03-19 07:47:22,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 2 times [2022-03-19 07:47:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:22,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818010529] [2022-03-19 07:47:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:22,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818010529] [2022-03-19 07:47:22,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818010529] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:22,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225859733] [2022-03-19 07:47:22,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225859733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:22,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:22,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320176351] [2022-03-19 07:47:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:22,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:22,949 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-03-19 07:47:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:23,067 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-03-19 07:47:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 07:47:23,068 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-03-19 07:47:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:23,068 INFO L225 Difference]: With dead ends: 74 [2022-03-19 07:47:23,069 INFO L226 Difference]: Without dead ends: 70 [2022-03-19 07:47:23,070 INFO L911 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-03-19 07:47:23,071 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:23,072 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-19 07:47:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-03-19 07:47:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-03-19 07:47:23,082 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-03-19 07:47:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:23,082 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-03-19 07:47:23,083 INFO L479 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-03-19 07:47:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-03-19 07:47:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 07:47:23,085 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:23,085 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:23,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 07:47:23,085 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-03-19 07:47:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166617328] [2022-03-19 07:47:23,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 2 times [2022-03-19 07:47:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:23,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580969001] [2022-03-19 07:47:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,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-03-19 07:47:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580969001] [2022-03-19 07:47:23,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580969001] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:23,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166617328] [2022-03-19 07:47:23,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166617328] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450708824] [2022-03-19 07:47:23,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:23,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:23,186 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-03-19 07:47:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:23,348 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-03-19 07:47:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:23,349 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-03-19 07:47:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:23,350 INFO L225 Difference]: With dead ends: 91 [2022-03-19 07:47:23,350 INFO L226 Difference]: Without dead ends: 89 [2022-03-19 07:47:23,351 INFO L911 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-03-19 07:47:23,351 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:23,351 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-19 07:47:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-03-19 07:47:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-03-19 07:47:23,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-03-19 07:47:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:23,363 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-03-19 07:47:23,363 INFO L479 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-03-19 07:47:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-03-19 07:47:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 07:47:23,363 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:23,363 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:23,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 07:47:23,364 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-03-19 07:47:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216251420] [2022-03-19 07:47:23,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 2 times [2022-03-19 07:47:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:23,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338089170] [2022-03-19 07:47:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:23,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338089170] [2022-03-19 07:47:23,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338089170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:23,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:23,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216251420] [2022-03-19 07:47:23,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216251420] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:23,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985635233] [2022-03-19 07:47:23,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:23,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:23,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:23,403 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-03-19 07:47:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:23,471 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-03-19 07:47:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 07:47:23,472 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-03-19 07:47:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:23,472 INFO L225 Difference]: With dead ends: 66 [2022-03-19 07:47:23,472 INFO L226 Difference]: Without dead ends: 64 [2022-03-19 07:47:23,473 INFO L911 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-03-19 07:47:23,473 INFO L912 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:23,474 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 07:47:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-19 07:47:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-03-19 07:47:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-03-19 07:47:23,484 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-03-19 07:47:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:23,484 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-03-19 07:47:23,484 INFO L479 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-03-19 07:47:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-03-19 07:47:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 07:47:23,485 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:23,485 INFO L500 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-03-19 07:47:23,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 07:47:23,485 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-03-19 07:47:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449675267] [2022-03-19 07:47:23,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 2 times [2022-03-19 07:47:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:23,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721402583] [2022-03-19 07:47:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:23,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721402583] [2022-03-19 07:47:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721402583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:23,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:23,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449675267] [2022-03-19 07:47:23,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449675267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 07:47:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147671836] [2022-03-19 07:47:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:23,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 07:47:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 07:47:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 07:47:23,523 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-03-19 07:47:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:23,591 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-03-19 07:47:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 07:47:23,592 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-03-19 07:47:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:23,592 INFO L225 Difference]: With dead ends: 64 [2022-03-19 07:47:23,592 INFO L226 Difference]: Without dead ends: 60 [2022-03-19 07:47:23,593 INFO L911 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-03-19 07:47:23,593 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 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-03-19 07:47:23,593 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 07:47:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-19 07:47:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-03-19 07:47:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-03-19 07:47:23,603 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-03-19 07:47:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:23,603 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-03-19 07:47:23,603 INFO L479 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-03-19 07:47:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-03-19 07:47:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 07:47:23,603 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:23,603 INFO L500 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-03-19 07:47:23,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 07:47:23,604 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-03-19 07:47:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425099977] [2022-03-19 07:47:23,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 2 times [2022-03-19 07:47:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:23,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650316107] [2022-03-19 07:47:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650316107] [2022-03-19 07:47:23,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650316107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:23,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:23,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425099977] [2022-03-19 07:47:23,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425099977] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:23,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 07:47:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206092589] [2022-03-19 07:47:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:23,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 07:47:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 07:47:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 07:47:23,667 INFO L87 Difference]: Start difference. First operand 60 states and 67 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-03-19 07:47:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:23,844 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-03-19 07:47:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:23,845 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-03-19 07:47:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:23,845 INFO L225 Difference]: With dead ends: 75 [2022-03-19 07:47:23,845 INFO L226 Difference]: Without dead ends: 73 [2022-03-19 07:47:23,846 INFO L911 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-03-19 07:47:23,846 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:23,846 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-19 07:47:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-03-19 07:47:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-03-19 07:47:23,859 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-03-19 07:47:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:23,859 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-03-19 07:47:23,859 INFO L479 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-03-19 07:47:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-03-19 07:47:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 07:47:23,859 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:23,860 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:23,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 07:47:23,860 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-03-19 07:47:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:23,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342004333] [2022-03-19 07:47:23,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 2 times [2022-03-19 07:47:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477703123] [2022-03-19 07:47:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:23,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477703123] [2022-03-19 07:47:23,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477703123] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 07:47:23,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032745526] [2022-03-19 07:47:23,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 07:47:23,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 07:47:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 07:47:23,930 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-03-19 07:47:23,951 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-03-19 07:47:23,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 07:47:23,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 07:47:24,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 07:47:24,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 07:47:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:24,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 07:47:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 07:47:24,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032745526] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 07:47:24,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 07:47:24,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-03-19 07:47:24,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:24,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342004333] [2022-03-19 07:47:24,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342004333] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:24,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:24,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667452282] [2022-03-19 07:47:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:24,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 07:47:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 07:47:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-19 07:47:24,417 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:24,566 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-03-19 07:47:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:24,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:24,567 INFO L225 Difference]: With dead ends: 72 [2022-03-19 07:47:24,567 INFO L226 Difference]: Without dead ends: 70 [2022-03-19 07:47:24,567 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-19 07:47:24,568 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:24,568 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-19 07:47:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-03-19 07:47:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 07:47:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-03-19 07:47:24,580 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-03-19 07:47:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:24,581 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-03-19 07:47:24,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-03-19 07:47:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 07:47:24,581 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:24,581 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 07:47:24,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 07:47:24,804 WARN L460 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-03-19 07:47:24,805 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:24,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-03-19 07:47:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:24,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102740701] [2022-03-19 07:47:24,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 2 times [2022-03-19 07:47:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:24,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842752476] [2022-03-19 07:47:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842752476] [2022-03-19 07:47:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842752476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 07:47:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237430340] [2022-03-19 07:47:24,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 07:47:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 07:47:24,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 07:47:24,875 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-03-19 07:47:24,903 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-03-19 07:47:24,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 07:47:24,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 07:47:24,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-19 07:47:24,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 07:47:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:25,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 07:47:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 07:47:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237430340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 07:47:25,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 07:47:25,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-03-19 07:47:25,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102740701] [2022-03-19 07:47:25,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102740701] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:25,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:25,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958038656] [2022-03-19 07:47:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:25,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 07:47:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 07:47:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-19 07:47:25,203 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:25,326 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-03-19 07:47:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:25,328 INFO L225 Difference]: With dead ends: 67 [2022-03-19 07:47:25,328 INFO L226 Difference]: Without dead ends: 65 [2022-03-19 07:47:25,328 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-19 07:47:25,329 INFO L912 BasicCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:25,329 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 53 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-19 07:47:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-03-19 07:47:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-03-19 07:47:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-03-19 07:47:25,340 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-03-19 07:47:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:25,340 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-03-19 07:47:25,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-03-19 07:47:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-03-19 07:47:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 07:47:25,340 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:25,340 INFO L500 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-03-19 07:47:25,368 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-03-19 07:47:25,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-19 07:47:25,568 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-03-19 07:47:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792518894] [2022-03-19 07:47:25,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 2 times [2022-03-19 07:47:25,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:25,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199211949] [2022-03-19 07:47:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:25,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199211949] [2022-03-19 07:47:25,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199211949] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:25,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:25,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:25,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792518894] [2022-03-19 07:47:25,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792518894] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:25,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:25,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710113076] [2022-03-19 07:47:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:25,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 07:47:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 07:47:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 07:47:25,632 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:25,750 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-03-19 07:47:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 07:47:25,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:25,751 INFO L225 Difference]: With dead ends: 56 [2022-03-19 07:47:25,752 INFO L226 Difference]: Without dead ends: 54 [2022-03-19 07:47:25,752 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-19 07:47:25,753 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:25,754 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 53 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-19 07:47:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-03-19 07:47:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-03-19 07:47:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-03-19 07:47:25,763 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-03-19 07:47:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:25,763 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-03-19 07:47:25,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-03-19 07:47:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 07:47:25,764 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 07:47:25,764 INFO L500 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-03-19 07:47:25,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 07:47:25,764 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 07:47:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 07:47:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-03-19 07:47:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:25,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [728948763] [2022-03-19 07:47:25,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 07:47:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 2 times [2022-03-19 07:47:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 07:47:25,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498953061] [2022-03-19 07:47:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 07:47:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 07:47:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 07:47:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 07:47:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 07:47:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 07:47:25,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498953061] [2022-03-19 07:47:25,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498953061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:25,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:25,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:25,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 07:47:25,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [728948763] [2022-03-19 07:47:25,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [728948763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 07:47:25,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 07:47:25,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 07:47:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765001097] [2022-03-19 07:47:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 07:47:25,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 07:47:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 07:47:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 07:47:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 07:47:25,850 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 07:47:25,946 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-03-19 07:47:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 07:47:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 07:47:25,947 INFO L225 Difference]: With dead ends: 39 [2022-03-19 07:47:25,947 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 07:47:25,947 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-19 07:47:25,948 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 07:47:25,948 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 07:47:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 07:47:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 07:47:25,948 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-03-19 07:47:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 07:47:25,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-03-19 07:47:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 07:47:25,949 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 07:47:25,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-03-19 07:47:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 07:47:25,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 07:47:25,951 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-03-19 07:47:25,951 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-03-19 07:47:25,952 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-03-19 07:47:25,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-03-19 07:47:25,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-19 07:47:25,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 07:47:37,148 WARN L232 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 07:47:54,641 WARN L232 SmtUtils]: Spent 14.69s on a formula simplification. DAG size of input: 76 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 07:47:58,793 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-19 07:47:58,793 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-19 07:47:58,793 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-19 07:47:58,794 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-03-19 07:47:58,794 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-03-19 07:47:58,794 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-03-19 07:47:58,794 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-03-19 07:47:58,794 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) the Hoare annotation is: false [2022-03-19 07:47:58,794 INFO L878 garLoopResultBuilder]: At program point L126(line 126) the Hoare annotation is: false [2022-03-19 07:47:58,794 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 402) the Hoare annotation is: true [2022-03-19 07:47:58,794 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: false [2022-03-19 07:47:58,794 INFO L878 garLoopResultBuilder]: At program point L176(line 176) the Hoare annotation is: false [2022-03-19 07:47:58,794 INFO L878 garLoopResultBuilder]: At program point L366(line 366) the Hoare annotation is: false [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L333(line 333) the Hoare annotation is: false [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 242) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2))) [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) the Hoare annotation is: false [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 160) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) the Hoare annotation is: false [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: false [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 401) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-03-19 07:47:58,795 INFO L878 garLoopResultBuilder]: At program point L276(lines 276 391) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) the Hoare annotation is: false [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L70(lines 70 94) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (and (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L186(lines 186 196) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L376(lines 376 385) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~18 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~19 0))) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) the Hoare annotation is: false [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L343(lines 343 352) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L112(lines 112 203) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,796 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 402) the Hoare annotation is: true [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) the Hoare annotation is: false [2022-03-19 07:47:58,796 INFO L878 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 209) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 255) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L295(lines 295 317) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L188(line 188) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: false [2022-03-19 07:47:58,797 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) the Hoare annotation is: false [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L32(lines 32 395) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L288(lines 288 390) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) the Hoare annotation is: false [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L222(lines 222 244) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 396) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L82(lines 82 92) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 162) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) the Hoare annotation is: false [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: false [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) the Hoare annotation is: false [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L124(lines 124 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,798 INFO L885 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L215(lines 215 250) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,798 INFO L878 garLoopResultBuilder]: At program point L50(lines 50 253) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L174(lines 174 198) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) the Hoare annotation is: false [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L364(lines 364 387) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~18 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L331(lines 331 354) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 393) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) the Hoare annotation is: false [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L133(lines 133 200) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: false [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) the Hoare annotation is: false [2022-03-19 07:47:58,799 INFO L878 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,800 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2022-03-19 07:47:58,800 INFO L878 garLoopResultBuilder]: At program point L307(lines 307 315) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-03-19 07:47:58,800 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) the Hoare annotation is: false [2022-03-19 07:47:58,800 INFO L878 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: false [2022-03-19 07:47:58,803 INFO L878 garLoopResultBuilder]: At program point L101(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 07:47:58,803 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 389) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0)))))) [2022-03-19 07:47:58,803 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,803 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 07:47:58,803 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,804 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,804 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,804 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,804 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 07:47:58,806 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 07:47:58,807 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 07:47:58,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 07:47:58 BoogieIcfgContainer [2022-03-19 07:47:58,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 07:47:58,831 INFO L158 Benchmark]: Toolchain (without parser) took 40490.15ms. Allocated memory was 181.4MB in the beginning and 588.3MB in the end (delta: 406.8MB). Free memory was 128.7MB in the beginning and 266.6MB in the end (delta: -137.9MB). Peak memory consumption was 330.2MB. Max. memory is 8.0GB. [2022-03-19 07:47:58,831 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 07:47:58,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.59ms. Allocated memory was 181.4MB in the beginning and 230.7MB in the end (delta: 49.3MB). Free memory was 128.5MB in the beginning and 201.9MB in the end (delta: -73.4MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-03-19 07:47:58,831 INFO L158 Benchmark]: Boogie Preprocessor took 26.24ms. Allocated memory is still 230.7MB. Free memory was 201.9MB in the beginning and 200.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 07:47:58,832 INFO L158 Benchmark]: RCFGBuilder took 442.09ms. Allocated memory is still 230.7MB. Free memory was 200.3MB in the beginning and 184.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-19 07:47:58,832 INFO L158 Benchmark]: TraceAbstraction took 39711.57ms. Allocated memory was 230.7MB in the beginning and 588.3MB in the end (delta: 357.6MB). Free memory was 184.1MB in the beginning and 266.6MB in the end (delta: -82.5MB). Peak memory consumption was 337.5MB. Max. memory is 8.0GB. [2022-03-19 07:47:58,833 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.15ms. Allocated memory is still 181.4MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.59ms. Allocated memory was 181.4MB in the beginning and 230.7MB in the end (delta: 49.3MB). Free memory was 128.5MB in the beginning and 201.9MB in the end (delta: -73.4MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.24ms. Allocated memory is still 230.7MB. Free memory was 201.9MB in the beginning and 200.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 442.09ms. Allocated memory is still 230.7MB. Free memory was 200.3MB in the beginning and 184.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 39711.57ms. Allocated memory was 230.7MB in the beginning and 588.3MB in the end (delta: 357.6MB). Free memory was 184.1MB in the beginning and 266.6MB in the end (delta: -82.5MB). Peak memory consumption was 337.5MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: 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, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 32.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1463 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1463 mSDsluCounter, 2843 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1750 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3300 IncrementalHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 1093 mSDtfsCounter, 3300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 80 PreInvPairs, 97 NumberOfFragments, 799 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1699038 FormulaSimplificationTreeSizeReduction, 31.3s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2584793 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 07:47:58,868 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...